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...
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...
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...
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 ...
Abstract. We consider the problem of finding and maintaining communication paths in wireless mobile ad hoc networks (MANET). We consider this problem as a bi-objective problem when...