66 search results - page 2 / 14 » The Polytope of Tree-Structured Binary Constraint Satisfacti... |
WG
2005
Springer
13 years 9 months ago
2005
Springer
PPSN
1998
Springer
13 years 8 months ago
1998
Springer
This paper presents a comparative study of Evolutionary Algorithms (EAs) for Constraint Satisfaction Problems (CSPs). We focus on EAs where fitness is based on penalization of cons...
RSA
2006
13 years 4 months ago
2006
Abstract. We study two natural models of randomly generated constraint satisfaction problems. We determine how quickly the domain size must grow with n to ensure that these models ...
SAC
2000
ACM
13 years 8 months ago
2000
ACM
AAAI
2012
11 years 6 months ago
2012
Novel tractable classes of the binary CSP (constraint satisfaction problem) have recently been discovered by studying classes of instances defined by excluding subproblems descri...