118 search results - page 3 / 24 » The Shortest Path Problem Under Partial Monitoring |
TEC
2002
13 years 5 months ago
2002
This paper presents a genetic algorithmic approach to the shortest path (SP) routing problem. Variable-length chromosomes (strings) and their genes (parameters) have been used for ...
SIGMOD
2009
ACM
14 years 6 months ago
2009
ACM
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. CAT(0) metric spaces constitute a far-reaching common generalization of Euclidean and hyperbolic spaces and simple polygons: any two points x and y of a CAT(0) metric spa...
INFOCOM
2010
IEEE
13 years 4 months ago
2010
IEEE
Abstract—We revisit the shortest path problem in asynchronous duty-cycled wireless sensor networks, which exhibit time-dependent features. We model the time-varying link cost and...
IWANN
1997
Springer
13 years 10 months ago
1997
Springer
: The path planning problem is relevant for all applications in which a mobil robot should autonomously navigate. Finding the shortest path in an environment that is only partialy ...