1594 search results - page 14 / 319 » An Algorithm to Compute Collusion Paths |
CGI
2004
IEEE
14 years 2 months ago
2004
IEEE
We give an efficient, scalable, and simple algorithm for computation of a central path for navigation in closed virtual environments. The algorithm requires less preprocessing and...
SSD
2005
Springer
14 years 4 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...
GIS
2010
ACM
13 years 9 months ago
2010
ACM
The problem of point-to-point shortest path computation in spatial networks is extensively studied with many approaches proposed to speed-up the computation. Most of the existing ...
ICALP
2004
Springer
14 years 4 months ago
2004
Springer
TKDE
2002
13 years 10 months ago
2002
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...