Sciweavers

95 search results - page 3 / 19
» Shortest Path Algorithms: An Evaluation Using Real Road Netw...
Sort
View
ISAAC
2010
Springer
308views Algorithms» more  ISAAC 2010»
13 years 5 months ago
Levelwise Mesh Sparsification for Shortest Path Queries
Shortest path query is a problem to answer the shortest path from the origin to the destination in short time. The network is fixed, and the goal of the study is to develop efficie...
Yuichiro Miyamoto, Takeaki Uno, Mikio Kubo
SOFSEM
2009
Springer
14 years 4 months ago
The Shortcut Problem - Complexity and Approximation
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...
Reinhard Bauer, Gianlorenzo D'Angelo, Daniel Delli...
CNSR
2010
IEEE
140views Communications» more  CNSR 2010»
13 years 11 months ago
Performance Evaluation of Using a Dynamic Shortest Path Algorithm in OLSRv2
—MANET routing protocols are designed to scale up to thousands of routers with frequent changes of the topology. In preference, MANET routing protocols should also support constr...
Ulrich Herberg
GIS
2002
ACM
13 years 7 months ago
A road network embedding technique for k-nearest neighbor search in moving object databases
A very important class of queries in GIS applications is the class of K-Nearest Neighbor queries. Most of the current studies on the K-Nearest Neighbor queries utilize spatial ind...
Cyrus Shahabi, Mohammad R. Kolahdouzan, Mehdi Shar...
AINA
2008
IEEE
14 years 1 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