763 search results - page 21 / 153 » Engineering Shortest Path Algorithms |
CCCG
2007
13 years 9 months ago
2007
A path from a point s to a point t on the surface of a polyhedral terrain is said to be descent if for every pair of points p = (x(p), y(p), z(p)) and q = (x(q), y(q), z(q)) on th...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
In this paper, we propose a Genetic Algorithm (GA) approach using a new paths growth procedure by the random key-based encoding for solving Shortest Path Routing (SPR) problem. An...
COMPGEOM
1998
ACM
13 years 12 months ago
1998
ACM
We present a new technique for constructing a data-structure that approximates shortest path maps in IRd . By applying this technique, we get the following two results on approxim...
TALG
2010
13 years 6 months ago
2010
We present two new algorithms for finding optimal strategies for discounted, infinite-horizon, Deterministic Markov Decision Processes (DMDP). The first one is an adaptation of...
ESA
2005
Springer
14 years 1 months ago
2005
Springer
We present a new speedup technique for route planning that exploits the hierarchy inherent in real world road networks. Our algorithm preprocesses the eight digit number of nodes n...