180 search results - page 2 / 36 » Complexity of Homogeneous Co-Boolean Constraint Satisfaction... |
AAAI
1996
13 years 6 months ago
1996
Learning during backtrack search is a space-intensive process that records information (such as additional constraints) in order to avoid redundant work. In this paper, we analyze...
AAAI
1997
13 years 6 months ago
1997
Cooperative distributed problem solving (CDPS) loosely-coupledagentscan be effectively modeledas a distributed constraint satisfaction problem(DCSP) whereeach agent has multiple l...
COCO
2004
Springer
13 years 10 months ago
2004
Springer
We prove a parameterized analog of Schaefer’s Dichotomy Theorem: we show that for every finite boolean constraint family F, deciding whether a formula containing constraints fr...
LICS
2009
IEEE
13 years 12 months ago
2009
IEEE
In a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality constraint is an ...
EMNLP
2007
13 years 6 months ago
2007
We present an adaptation of constraint satisfaction inference (Canisius et al., 2006b) for predicting dependency trees. Three different classifiers are trained to predict weighte...