Sciweavers

133 search results - page 22 / 27
» DIJKSTRA
Sort
View
GISCIENCE
2008
Springer
141views GIS» more  GISCIENCE 2008»
13 years 8 months ago
Simplest Instructions: Finding Easy-to-Describe Routes for Navigation
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...
Kai-Florian Richter, Matt Duckham
GLOBECOM
2008
IEEE
13 years 8 months ago
Probabilistic Path Selection in Opportunistic Cognitive Radio Networks
Abstract—We present a novel routing approach for multichannel cognitive radio networks (CRNs). Our approach is based on probabilistically estimating the available capacity of eve...
Hicham Khalife, Satyajeet Ahuja, Naceur Malouch, M...
TON
2008
95views more  TON 2008»
13 years 7 months ago
Integration of explicit effective-bandwidth-based QoS routing with best-effort routing
This paper presents a methodology for protecting low-priority best-effort (BE) traffic in a network domain that provides both virtual-circuit routing with bandwidth reservation for...
Stephen L. Spitler, Daniel C. Lee
PVLDB
2010
146views more  PVLDB 2010»
13 years 6 months ago
Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions
The current widespread use of location-based services and GPS technologies has revived interest in very fast and scalable shortest path queries. We introduce a new shortest path q...
Michael Rice, Vassilis J. Tsotras
4OR
2010
148views more  4OR 2010»
13 years 6 months ago
Point-to-point shortest paths on dynamic time-dependent road networks
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. ...
Giacomo Nannicini