706 search results - page 36 / 142 » Efficient Algorithms for k -Disjoint Paths Problems on DAGs |
JMLR
2010
13 years 2 months ago
2010
For a given target node T and a given depth k 1, we propose an algorithm for discovering a local causal network around the target T to depth k. In our algorithm, we find parents,...
CII
2006
13 years 7 months ago
2006
Tool path generation is one of the most complex problems in Computer Aided Manufacturing. Although some efficient strategies have been developed, most of them are only useful for s...
IJRR
2002
13 years 7 months ago
2002
We study the path planning problem, without obstacles, for closed kinematic chains with n links connected by spherical joints in space or revolute joints in the plane. The configu...
ESA
2004
Springer
14 years 1 months ago
2004
Springer
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
DCOSS
2007
Springer
13 years 11 months ago
2007
Springer
The problem we address in this paper is how to detect an intruder moving through a polygonal space that is equipped with a camera sensor network. We propose a probabilistic sensor ...