127 search results - page 16 / 26 » The Directed Planar Reachability Problem |
PUK
2000
13 years 11 months ago
2000
Abstract. In this paper we study traditional and enhanced BDDbased exploration procedures capable of handling large planning problems. On the one hand, reachability analysis and mo...
CORR
2011
Springer
13 years 4 months ago
2011
Springer
We consider the problem of human-assisted graph search: given a directed acyclic graph with some (unknown) target node(s), we consider the problem of finding the target node(s) b...
ICASSP
2008
IEEE
14 years 4 months ago
2008
IEEE
We consider the problem of planar object registration on binary images where the aligning transformation is restricted to the group of affine transformations. Previous approaches...
ISCAS
2003
IEEE
14 years 3 months ago
2003
IEEE
In this paper, we present a precise characterization of the existence of a convergent transfer subgraph in an edge colored directed acyclic graph. Based on the characterization, l...
TACAS
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. In this paper we prove that the transitive closure of a nondeterministic octagonal relation using integer counters can be expressed in Presburger arithmetic. The direct c...