2796 search results - page 147 / 560 » The coolest path problem |
138
click to vote
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract— We consider the problem of optimizing the trajectory of a mobile sensor with perfect localization whose task is to estimate a stochastic, perhaps multidimensional fiel...
124
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v V is said to be t-approximate shortest path if its length is at most t tim...
161
click to vote
WADS
2007
Springer
15 years 11 months ago
2007
Springer
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
154
click to vote
CAINE
2004
15 years 6 months ago
2004
The problem of finding a shortest path is common to many different fields including transportation systems, mechanical systems and computer communications. Most telecommunication ...
123
click to vote
IPSN
2005
Springer
15 years 10 months ago
2005
Springer
: This paper addresses the problem of maximizing the service lifetime of a distributed battery-powered sensor network in the context of the network interdiction problem under user-...