3678 search results - page 91 / 736 » On the Stable Paths Problem |
102
Voted
IDEAS
2007
IEEE
15 years 7 months ago
2007
IEEE
In this paper we study the problem of deciding whether a regular path query over views in data-integration systems can be re-expressed without recursion. The problem becomes chall...
100
Voted
ACMSE
2006
ACM
15 years 6 months ago
2006
ACM
This paper considers the design of a camera path through a scene. Given a valid set of keyframes for the camera, we want to build a camera path that avoids collisions with the sce...
ICRA
2000
IEEE
15 years 5 months ago
2000
IEEE
This paper addresses the following inspection problem: given a known workspace and a robot with vision capabilities compute a short path path for the robot such that each point on...
116
click to vote
JCP
2007
15 years 18 days ago
2007
— In this paper, we study the dynamic version of the distributed all-pairs shortest paths problem. Most of the solutions given in the literature for this problem, either (i) work...
103
click to vote
STACS
2010
Springer
15 years 7 months ago
2010
Springer
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...