Sciweavers

866 search results - page 37 / 174
» On Dynamic Shortest Paths Problems
Sort
View
GECCO
2008
Springer
110views Optimization» more  GECCO 2008»
13 years 8 months ago
Crossover can provably be useful in evolutionary computation
We show that the natural evolutionary algorithm for the all-pairs shortest path problem is significantly faster with a crossover operator than without. This is the first theoret...
Benjamin Doerr, Edda Happ, Christian Klein
CIKM
2009
Springer
14 years 2 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...
TKDE
2002
239views more  TKDE 2002»
13 years 7 months ago
An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps
In this paper, we have developed a HiTi (Hierarchical MulTi) graph model for structuring large topographical road maps to the minimum cost route computation. The HiTi graph model p...
Sungwon Jung, Sakti Pramanik
ICRA
2008
IEEE
140views Robotics» more  ICRA 2008»
14 years 2 months ago
Dynamic visibility checking for vision-based motion planning
— An important problem in position-based visual servoing (PBVS) is to guarantee that a target will remain within the field of view for the duration of the task. In this paper, w...
Simon Léonard, Elizabeth A. Croft, James J....
MASS
2010
186views Communications» more  MASS 2010»
13 years 5 months ago
VAN: Vehicle-assisted shortest-time path navigation
Traffic congestion is a very serious problem in large cities. With the number of vehicles increasing rapidly, especially in cities whose economy is booming, the situation is gettin...
Wenping Chen, Sencun Zhu, Deying Li