711 search results - page 30 / 143 » Amalgams of Constraint Satisfaction Problems |
DAGSTUHL
2008
15 years 1 months ago
2008
Abstract. We describe an algebraic approach to the constraint satisfaction problem (CSP) and present recent results on the CSP that make use of, in an essential way, this algebraic...
103
click to vote
CPAIOR
2006
Springer
15 years 3 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...
SIAMDM
2008
14 years 11 months 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 1 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...
GECCO
2008
Springer
15 years 25 days ago
2008
Springer
In this paper a new approach to solve constrained multi-objective problems by way of evolutionary multi-objective optimization is introduced. In contrast to former evolutionary ap...