1578 search results - page 71 / 316 » Direct Routing: Algorithms and Complexity |
135
Voted
ESA
2010
Springer
15 years 4 months ago
2010
Springer
We show how to route on very large public transportation networks (up to half a billion arcs) with average query times of a few milliseconds. We take into account many realistic fe...
114
Voted
ICDE
2011
IEEE
14 years 7 months ago
2011
IEEE
—The booming industry of location-based services has accumulated a huge collection of users’ location trajectories of driving, cycling, hiking, etc. In this work, we investigat...
117
click to vote
ICPADS
1998
IEEE
15 years 7 months ago
1998
IEEE
With respect to scalability and arbitrary topologies of the underlying networks in multiprogramming and multithread environment, fault tolerance in acknowledged ATAB and concurren...
131
Voted
WEA
2007
Springer
15 years 9 months ago
2007
Springer
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
120
click to vote
IMC
2007
ACM
15 years 5 months ago
2007
ACM
Multi-hop wireless mesh networks are increasingly being deployed for last-mile Internet access. Typically, network algorithms such as routing, channel assignment and topology cont...