473 search results - page 28 / 95 » Computing shortest paths with uncertainty |
LCN
2006
IEEE
15 years 3 months ago
2006
IEEE
Today’s intra-domain protocols are limited in their scalability. We examine these limitations and propose an alternative in the form of an IGP based on path vectors. Taking adva...
IWCMC
2009
ACM
15 years 4 months ago
2009
ACM
This paper addresses the additional energy consumption in wireless sensor networks where the communication between the sensor nodes and the sink nodes does not always make use of ...
106
click to vote
ICDE
2012
IEEE
13 years 3 days ago
2012
IEEE
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
ISVD
2007
IEEE
15 years 4 months ago
2007
IEEE
We consider the problem of computing the time convex hull of a set of points in the presence of a straight-line highway in the plane. The traveling speed in the plane is assumed t...
78
Voted
ICRA
2010
IEEE
14 years 8 months ago
2010
IEEE
Suppose we want to move a passive object along a given path, among obstacles in the plane, by pushing it with an active robot. We present two algorithms to compute a push plan for...