Sciweavers

189 search results - page 4 / 38
» Shortest Paths Without a Map
Sort
View
DATESO
2009
114views Database» more  DATESO 2009»
13 years 5 months ago
Speeding Up Shortest Path Search in Public Transport Networks
Abstract. The searching for the shortest path in public transport networks can take more time than is acceptable for given situation. We have therefore searched for methods that sp...
Vladislav Martinek, Michal Zemlicka
INFOCOM
2008
IEEE
14 years 2 months ago
Circular Sailing Routing for Wireless Networks
Abstract—Routing in wireless networks has been heavily studied in the last decade and numerous routing protocols were proposed in literature. The packets usually follow the short...
Fan Li, Yu Wang 0003
ICALT
2006
IEEE
14 years 1 months ago
A Shortest Learning Path Selection Algorithm in E-learning
Generally speaking, in the e-learning systems, a course is modeled as a graph, where each node represents a knowledge node (KU) and two nodes are connected to form a semantic netw...
Chengling Zhao, Liyong Wan
ICDE
2010
IEEE
247views Database» more  ICDE 2010»
14 years 7 months ago
Efficient Verification of Shortest Path Search via Authenticated Hints
Shortest path search in transportation networks is unarguably one of the most important online search services nowadays (e.g., Google Maps, MapQuest, etc), with applications spanni...
Man Lung Yiu, Yimin Lin, Kyriakos Mouratidis
APPROX
2009
Springer
125views Algorithms» more  APPROX 2009»
14 years 2 months ago
Minimizing Average Shortest Path Distances via Shortcut Edge Addition
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
Adam Meyerson, Brian Tagiku