89 search results - page 2 / 18 » On the computational complexity and effectiveness of N-hub s... |
COSIT
2003
Springer
13 years 11 months ago
2003
Springer
Numerous cognitive studies have indicated that the form and complexity of route instructions may be as important to human navigators as the overall length of route. Most automated ...
4OR
2010
13 years 4 months ago
2010
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
GISCIENCE
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. Current applications for wayfinding and navigation assistance usually calculate the route to a destination based on the shortest or fastest path from the origin. However...
ICNP
1997
IEEE
13 years 10 months ago
1997
IEEE
Future computer networks are expected to carry bursty traffic. Shortest -path routing protocols such as OSPF and RIP have t he disadvantage of causing bottlenecks due to their inh...
AINA
2008
IEEE
14 years 23 days ago
2008
IEEE
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...