22 search results - page 1 / 5 » Engineering Time-Dependent Many-to-Many Shortest Paths Compu... |
ATMOS
2010
13 years 10 months ago
2010
WEA
2010
Springer
14 years 4 months ago
2010
Springer
Server based route planning in road networks is now powerful enough to find quickest paths in a matter of milliseconds, even if detailed information on time-dependent travel times...
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 ...
ESA
2008
Springer
14 years 23 days ago
2008
Springer
In recent years, many speed-up techniques for Dijkstra's algorithm have been developed that make the computation of shortest paths in static road networks a matter of microse...
IWCMC
2009
ACM
14 years 5 months ago
2009
ACM
This paper addresses the additional energy consumption in wireless sensor networks where the communication between the sensor nodes and the sink nodes does not always make use of ...