Sciweavers

1568 search results - page 163 / 314
» The problem of examination questions in algorithmics
Sort
View
ESA
2008
Springer
108views Algorithms» more  ESA 2008»
15 years 8 months ago
Two-Stage Robust Network Design with Exponential Scenarios
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, ...
ECSQARU
2009
Springer
16 years 29 days ago
Local Computation Schemes with Partially Ordered Preferences
Many computational problems linked to reasoning under uncertainty can be expressed in terms of computing the marginal(s) of the combination of a collection of (local) valuation fun...
Hélène Fargier, Nic Wilson
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
15 years 10 months ago
Algebraic simplification of GP programs during evolution
Program bloat is a fundamental problem in the field of Genetic Programming (GP). Exponential growth of redundant and functionally useless sections of programs can quickly overcome...
Phillip Wong, Mengjie Zhang
GECCO
2008
Springer
129views Optimization» more  GECCO 2008»
15 years 7 months ago
Exploiting the path of least resistance in evolution
Hereditary Repulsion (HR) is a selection method coupled with a fitness constraint that substantially improves the performance and consistency of evolutionary algorithms. This als...
Gearoid Murphy, Conor Ryan
ICRA
2010
IEEE
130views Robotics» more  ICRA 2010»
15 years 4 months ago
Multi-robot coordination with periodic connectivity
Abstract— We consider the problem of multi-robot coordination subject to constraints on the configuration. Specifically, we examine the case in which a mobile network of robots...
Geoffrey Hollinger, Sanjiv Singh