Sciweavers

866 search results - page 25 / 174
» On Dynamic Shortest Paths Problems
Sort
View
SSD
2005
Springer
153views Database» more  SSD 2005»
14 years 1 months ago
Constrained Shortest Path Computation
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...
Manolis Terrovitis, Spiridon Bakiras, Dimitris Pap...
CCCG
2010
13 years 9 months ago
Approximate shortest path algorithms for sequences of pairwise disjoint simple polygons
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...
Xiuxia Pan, Fajie Li, Reinhard Klette
AINA
2008
IEEE
14 years 2 months ago
A Map Matching Algorithm for Car Navigation Systems that Predict User Destination
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...
Koichi Miyashita, Tsutomu Terada, Shojiro Nishio
JAL
2007
95views more  JAL 2007»
13 years 7 months ago
Computing shortest paths with uncertainty
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...
Tomás Feder, Rajeev Motwani, Liadan O'Calla...
WSC
2008
13 years 10 months ago
On step sizes, stochastic shortest paths, and survival probabilities in Reinforcement Learning
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...
Abhijit Gosavi