Sciweavers

72 search results - page 8 / 15
» esa 2008
Sort
View
ESA
2008
Springer
124views Algorithms» more  ESA 2008»
14 years 11 months ago
Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions
A truthful mechanism consists of an algorithm augmented with a suitable payment function which guarantees that the "players" cannot improve their utilities by "chea...
Paolo Penna, Carmine Ventre
ESA
2008
Springer
137views Algorithms» more  ESA 2008»
14 years 11 months ago
Flexible Path Planning Using Corridor Maps
Path planning is a central problem in virtual environments and games. When computer-controlled characters move around in virtual worlds they have to plan their paths to desired loc...
Mark H. Overmars, Ioannis Karamouzas, Roland Gerae...
ESA
2008
Springer
115views Algorithms» more  ESA 2008»
14 years 11 months ago
Deterministic Sampling Algorithms for Network Design
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
Anke van Zuylen
ESA
2008
Springer
111views Algorithms» more  ESA 2008»
14 years 11 months ago
Parallel Imaging Problem
Metric Labeling problems have been introduced as a model for understanding noisy data with pair-wise relations between the data points. One application of labeling problems with pa...
Thành Nguyen, Éva Tardos
ESA
2008
Springer
136views Algorithms» more  ESA 2008»
14 years 11 months ago
Oblivious Randomized Direct Search for Real-Parameter Optimization
The focus is on black-box optimization of a function f : RN R given as a black box, i. e. an oracle for f-evaluations. This is commonly called direct search, and in fact, most meth...
Jens Jägersküpper