Sciweavers

3678 search results - page 186 / 736
» On the Stable Paths Problem
Sort
View
144
Voted
GECCO
2009
Springer
133views Optimization» more  GECCO 2009»
15 years 1 months ago
Improved analysis methods for crossover-based algorithms
We deepen the theoretical analysis of the genetic algorithm for the all-pairs shortest path problem proposed by Doerr, Happ and Klein (GECCO 2008). We show that the growth of the ...
Benjamin Doerr, Madeleine Theile
120
Voted
AAIM
2008
Springer
105views Algorithms» more  AAIM 2008»
15 years 10 months ago
Finding Optimal Refueling Policies in Transportation Networks
We study the combinatorial properties of optimal refueling policies, which specify the transportation paths and the refueling operations along the paths to minimize the total trans...
Shieu-Hong Lin
108
Voted
ICRA
2006
IEEE
72views Robotics» more  ICRA 2006»
15 years 9 months ago
Multi-robot Boundary Coverage with Plan Revision
Abstract— This paper revisits the multi-robot boundary coverage problem in which a group of k robots must inspect every point on the boundary of a 2-dimensional environment. We f...
Kjerstin Williams, Joel Burdick
120
Voted
STACS
1999
Springer
15 years 8 months ago
An Optimal Competitive Strategy for Walking in Streets
We present an optimal strategy for searching for a goal in a street which achieves the competitive factor of √ 2, thus matching the best lower bound known before. This finally ...
Christian Icking, Rolf Klein, Elmar Langetepe
121
Voted
CCCG
1996
15 years 5 months ago
Heuristic Motion Planning with Many Degrees of Freedom
We present a heuristic approach to the geometric motion planning problem with the aim to quickly solve intuitively simple problems. It is based on a divide-and-conquer path search...
Thomas Chadzelek, Jens Eckstein, Elmar Schöme...