860 search results - page 17 / 172 » An Efficient Technique for Distance Computation in Road Netw... |
SOFSEM
2009
Springer
14 years 4 months ago
2009
Springer
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...
ALGORITHMICA
2008
13 years 7 months ago
2008
In this paper we present techniques to significantly improve the space complexity of several ordered tree comparison algorithms without sacrificing the corresponding time complexit...
JSAC
2006
13 years 7 months ago
2006
The responsiveness of networked applications is limited by communications delays, making network distance an important parameter in optimizing the choice of communications peers. S...
ICPR
2002
IEEE
14 years 8 months ago
2002
IEEE
This paper introduces an approach for handling complex labelling problems driven by local constraints. The purpose is illustrated by two applications: detection of the road networ...
WSC
2004
13 years 8 months ago
2004
Exactly computing network reliability measures is an NPhard problem. Therefore, Monte Carlo simulation has been frequently used by network designers to obtain accurate estimates. ...