3678 search results - page 113 / 736 » On the Stable Paths Problem |
120
click to vote
SSD
2005
Springer
15 years 6 months ago
2005
Springer
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequen...
98
Voted
COMPGEOM
2004
ACM
15 years 6 months ago
2004
ACM
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
111
Voted
COMBINATORICS
2002
15 years 18 days ago
2002
In a previous work [26], by considering paths that are partially weighted, the generating function of Dyck paths was shown to possess a type of symmetry, called an exchange relati...
116
click to vote
INFOCOM
2010
IEEE
14 years 11 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...
92
Voted
CP
2005
Springer
15 years 6 months ago
2005
Springer
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...