566 search results - page 7 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
AI
2004
Springer
15 years 2 months ago
2004
Springer
Constraints formalize the dependencies in a physical world in terms of a logical relation among several unknowns. Constraint satisfaction methods allow efficient navigation of larg...
85
Voted
EMNLP
2007
14 years 11 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...
71
Voted
IPL
2007
14 years 9 months ago
2007
Abstract. The Semiring Constraint Satisfaction Problem (SCSP) framework is a popular approach for the representation of partial constraint satisfaction problems. In this framework ...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...