405 search results - page 3 / 81 » On the Complexity of Global Constraint Satisfaction |
80
Voted
IJCAI
2001
15 years 2 months ago
2001
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
106
Voted
EMNLP
2007
15 years 2 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...
CONSTRAINTS
2007
15 years 1 months ago
2007
123
Voted
JACM
2010
14 years 11 months ago
2010
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
130
Voted
FOCS
2008
IEEE
15 years 2 months ago
2008
IEEE
We consider random instances of constraint satisfaction problems where each variable has domain size O(1), each constraint is on O(1) variables and the constraints are chosen from...