3678 search results - page 137 / 736 » On the Stable Paths Problem |
118
click to vote
JDA
2006
15 years 29 days ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
134
click to vote
AIPS
2011
14 years 4 months ago
2011
Research in efficient methods for solving infinite-horizon MDPs has so far concentrated primarily on discounted MDPs and the more general stochastic shortest path problems (SSPs...
CDC
2009
IEEE
15 years 5 months ago
2009
IEEE
— The paper studies the coordinated path following problem, namely, steering a group of unicycles to a given path while achieving an inter-vehicle formation pattern. A novel hybr...
VLSID
2000
IEEE
15 years 5 months ago
2000
IEEE
We consider the problem of timing analysis in the presence of known false paths. The main difficulty in adaptation of classical breadth-first search to the problem is that at each...
COLING
2008
15 years 2 months ago
2008
This paper presents an approach for substantially reducing the time needed to calculate the shortest paths between all concepts in a wordnet. The algorithm exploits the unique &qu...