110 search results - page 12 / 22 » Interleaved Depth-First Search |
IEAAIE
2001
Springer
14 years 27 days ago
2001
Springer
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
CP
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. Constraint propagation solvers interleave propagation, removing impossible values from variable domains, with search. The solver state is modified during propagation. But...
INLG
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We present a new approach to the generation of referring expressions containing attributive, type and relational properties combined by conjunctions, disjunctions and neg...
CAV
2010
Springer
14 years 9 days ago
2010
Springer
Testing of multi-threaded programs poses enormous challenges. To improve the coverage of testing, we present a framework named CONTESSA that augments conventional testing (concrete...
UAI
1998
13 years 9 months ago
1998
We describe computationally efficient methods for learning mixtures in which each component is a directed acyclic graphical model (mixtures of DAGs or MDAGs). We argue that simple...