714 search results - page 31 / 143 » Lexicographically-ordered constraint satisfaction problems |
119
click to vote
CPAIOR
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. We present a theoretical study on the idea of using mathematical programming relaxations for filtering binary constraint satisfaction problems. We introduce the consisten...
100
click to vote
SIAMDM
2008
15 years 25 days ago
2008
Recently, a strong link has been discovered between supermodularity on lattices and tractability of optimization problems known as maximum constraint satisfaction problems. The pre...
DAGSTUHL
2006
15 years 2 months ago
2006
Abstract. The general intractability of the constraint satisfaction problem (CSP) has motivated the study of the complexity of restricted cases of this problem. Thus far, the liter...
ICCD
2007
IEEE
15 years 10 months ago
2007
IEEE
We present new techniques for explicit constraint satisfaction in the incremental placement process. Our algorithm employs a Lagrangian Relaxation (LR) type approach in the analyt...
107
click to vote
CP
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. This paper offers a critique of the framework of Constraint Satisfaction Problems. While this framework has been successful in studying search techniques, and has inspire...