866 search results - page 25 / 174 » On Dynamic Shortest Paths Problems |
111
click to vote
SSD
2005
Springer
15 years 5 months ago
2005
Springer
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequen...
CCCG
2010
15 years 1 months ago
2010
Assume that two points p and q are given and a finite ordered set of simple polygons, all in the same plane; the basic version of a touring-a-sequence-of-polygons problem (TPP) is...
AINA
2008
IEEE
15 years 6 months ago
2008
IEEE
In this paper, we propose a map matching algorithm for car navigation systems that predict user destination. This car navigation system is a novel system that automatically predict...
JAL
2007
14 years 11 months ago
2007
Abstract. We consider the problem of estimating the length of a shortest path in a DAG whose edge lengths are known only approximately but can be determined exactly at a cost. Init...
WSC
2008
15 years 2 months ago
2008
Reinforcement Learning (RL) is a simulation-based technique useful in solving Markov decision processes if their transition probabilities are not easily obtainable or if the probl...