Sciweavers

353 search results - page 30 / 71
» Two-phase Algorithms for the Parametric Shortest Path Proble...
Sort
View
CORR
2008
Springer
88views Education» more  CORR 2008»
13 years 8 months ago
Lower bounds for distributed markov chain problems
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
Rahul Sami, Andy Twigg
ICRA
2005
IEEE
114views Robotics» more  ICRA 2005»
14 years 2 months ago
Minimum Distance Localization for a Robot with Limited Visibility
— Minimum distance localization is the problem of finding the shortest possible path for a robot to eliminate ambiguity regarding its position in the environment. We consider th...
Malvika Rao, Gregory Dudek, Sue Whitesides
MUE
2008
IEEE
137views Multimedia» more  MUE 2008»
14 years 3 months ago
Genetic Algorithm for Shortest Driving Time in Intelligent Transportation Systems
The route guidance system, which provides driving advice based on traffic information about an origin and a destination, has become very popular along with the advancement of hand...
Chu-Hsing Lin, Jui-Ling Yu, Jung-Chun Liu, Chia-Je...
NETWORKS
2007
13 years 8 months ago
Tailoring neighborhood search for the internet protocol network design problem with reliability and routing constraints
The Internet Protocol Network Design Problem with Reliability and Routing Constraints (IPRR) can be shortly stated as follows. A telecommunication network is given in terms of a s...
Luigi De Giovanni, Roberto Tadei
JCO
2006
106views more  JCO 2006»
13 years 8 months ago
Reliable Ad Hoc Routing Based on Mobility Prediction
Reliability is a very important issue in Mobile Ad hoc NETworks (MANETs). Shortest paths are usually used to route packets in MANETs. However, a shortest path may fail quickly, bec...
Jian Tang, Guoliang Xue, Weiyi Zhang