2834 search results - page 204 / 567 » Representing Trees with Constraints |
CP
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. Variable elimination is the basic step of Adaptive Consistency 4 . It transforms the problem into an equivalent one, having one less variable. Unfortunately, there are ma...
124
click to vote
MM
1993
ACM
15 years 4 months ago
1993
ACM
as a tree which specifies the presentation in an abstract, machineindependent way. This specification is created and edited using an authoring system; it is mapped to a particula...
78
Voted
ICRA
2010
IEEE
14 years 11 months ago
2010
IEEE
Abstract— Kinodynamic planning algorithms like RapidlyExploring Randomized Trees (RRTs) hold the promise of finding feasible trajectories for rich dynamical systems with complex...
95
Voted
ICCV
2007
IEEE
16 years 2 months ago
2007
IEEE
We pose robust matching with parametric and non-parametric constraints as the problem of finding a stable independent set (SIS) in an oriented graph whose vertices are all possible...
102
click to vote
ASAP
1997
IEEE
15 years 4 months ago
1997
IEEE
This paper presents a technique to map automatically a complete digital signal processing (DSP) application onto a parallel machine with distributed memory. Unlike other applicati...