Prof. Dr. Roger Wattenhofer phone +fax +Diploma/Master’s Thesis “Comparison of Ad Hoc Routing Algorithms”

Source URL: disco.ethz.ch

• Wireless networking
• Computing
• Wireless ad hoc network
• Network architecture
• Routing
• Algorithm
• Maximum-Residual Multicast Protocol
• Greedy Perimeter Stateless Routing in Wireless Networks

Advances in Cognitive SystemsSubmitted; publishedVariations on a Theory of Problem Solving Pat Langley

Source URL: www.cogsys.org

• Artificial intelligence
• Mathematics
• Numerical analysis
• Neuropsychology
• Problem solving
• Greedy algorithm
• Means-ends analysis
• Heuristic
• Decomposition method
• Andor tree

Mechanism Design by Creditability? Raphael Eidenbenz, Yvonne Anne Oswald, Stefan Schmid, and Roger Wattenhofer Computer Engineering and Networks Laboratory ETH Zurich, Switzerland Abstract. This paper attends to the pro

Source URL: disco.ethz.ch

• Mathematics
• Game theory
• Algorithm
• Mathematical logic
• Theoretical computer science
• Greedy algorithm
• Mechanism design
• Nash equilibrium

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 26, NO. X,

Source URL: www.cs.uoi.gr

• Mathematics
• Operations research
• Computational complexity theory
• Combinatorics
• Combinatorial optimization
• NP-complete problems
• Set cover problem
• Greedy algorithm
• Heuristic
• Integer programming
• Matching
• Linear programming

CONSTRUCTION PROBLEMS VIPUL NAIK Abstract. In this article, I describe the general problem of constructing configurations subject to certain conditions, and the use of techniques like “greedy algorithms” to construct

Source URL: files.vipulnaik.com

• Mathematical analysis
• Algebra
• Mathematics
• Fourier analysis
• Functional analysis
• Binary operations
• Image processing
• Convolution
• Feature detection
• Tessellation

PASS Approximation: A Framework for Analyzing and Designing Heuristics Uriel Feige ∗† Nicole Immorlica ∗‡

Source URL: users.eecs.northwestern.edu

• Computational complexity theory
• Mathematics
• Theory of computation
• NP-complete problems
• Operations research
• Approximation algorithms
• Combinatorial optimization
• Set cover problem
• Linear programming relaxation
• Greedy algorithm
• Facility location problem
• Reduction

ALGORITHMS FOR SIMULTANEOUS SPARSE APPROXIMATION PART I: GREEDY PURSUIT JOEL A. TROPP, ANNA C. GILBERT, AND MARTIN J. STRAUSS Abstract. A simultaneous sparse approximation problem requests a good approximation of several

Source URL: users.cms.caltech.edu

• Algebra
• Mathematics
• Linear algebra
• Numerical linear algebra
• Multivariate statistics
• Signal processing
• Sparse approximation
• Matching pursuit
• Matrix theory
• Matrix
• Vector space
• Sparse dictionary learning

CS364B: Frontiers in Mechanism Design Bonus Lecture: Gross Substitutes and Greedy Algorithms∗ Tim Roughgarden† February 7, 2014

Source URL: theory.stanford.edu

• Mathematics
• Algebraic geometry
• Gross substitutes
• Valuation
• Competitive equilibrium
• Submodular set function
• Mechanism design

fea-mcgeoch.qxp:58 AM

Source URL: www.ams.org

• Computational complexity theory
• Theory of computation
• Mathematics
• Complexity classes
• Analysis of algorithms
• Graph coloring
• Theoretical computer science
• Algorithm
• NP
• Time complexity
• Greedy algorithm
• P

Adaptive Approximation by Greedy Algorithms Albert Cohen University of Paris VI (France) This talk will discuss computational algorithms that deal with the following general task: given a function f and a dictionary of f

Source URL: math.nyu.edu