390 search results - page 39 / 78 » Computing shortest paths for any number of hops |
101
click to vote
ICRA
2006
IEEE
15 years 8 months ago
2006
IEEE
— We consider the problem of path planning above a polyhedral terrain and present a new algorithm that for any p ≥ 1, computes a (c + ε)-approximation to the Lp-shortest path ...
133
Voted
CGI
2009
IEEE
15 years 5 months ago
2009
IEEE
Despite the clear benefits that stream and path surfaces bring when visualizing 3D vector fields, their use in both industry and for research has not proliferated. This is due, in...
106
click to vote
IPPS
2006
IEEE
15 years 8 months ago
2006
IEEE
In this paper, we consider filtering false reports in braided multipath routing sensor networks. While multipath routing provides better resilience to various faults in sensor ne...
128
click to vote
CONEXT
2007
ACM
15 years 5 months ago
2007
ACM
Protocol extensions for a mobile Internet have been developed within the IETF, but a standard design of mobile multicast is still awaited. Multicast routing, when adapting its dis...
118
click to vote
WSNA
2003
ACM
15 years 7 months ago
2003
ACM
Motivated by realistic sensor network scenarios that have mis-informed nodes and variable network topologies, we propose a fundamentally different approach to routing that combine...