Sciweavers

1578 search results - page 71 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
ESA
2010
Springer
185views Algorithms» more  ESA 2010»
13 years 9 months ago
Fast Routing in Very Large Public Transportation Networks Using Transfer Patterns
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...
Hannah Bast, Erik Carlsson, Arno Eigenwillig, Robe...
ICDE
2011
IEEE
245views Database» more  ICDE 2011»
13 years 14 days ago
Discovering popular routes from trajectories
—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...
Zaiben Chen, Heng Tao Shen, Xiaofang Zhou
ICPADS
1998
IEEE
14 years 10 days ago
Fault Tolerant All-to-All Broadcast in General Interconnection Networks
With respect to scalability and arbitrary topologies of the underlying networks in multiprogramming and multithread environment, fault tolerance in acknowledged ATAB and concurren...
Yuzhong Sun, Paul Y. S. Cheung, Xiaola Lin, Keqin ...
WEA
2007
Springer
74views Algorithms» more  WEA 2007»
14 years 2 months ago
Landmark-Based Routing in Dynamic Graphs
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 ...
Daniel Delling, Dorothea Wagner
IMC
2007
ACM
13 years 10 months ago
Studying wireless routing link metric dynamics
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...
Saumitra M. Das, Himabindu Pucha, Konstantina Papa...