138 search results - page 3 / 28 » Domain Transmutation in Constraint Satisfaction Problems |
ASE
1998
13 years 5 months ago
1998
The process of understanding a source code in a high-level programming language involves complex computation. Given a piece of legacy code and a library of program plan templates, ...
AICCSA
2001
IEEE
13 years 9 months ago
2001
IEEE
This paper2 details the stages of building a substantial, carefully specified, fully tested and fully operational university and school timetabling system. This is reported as a c...
RSA
2006
13 years 5 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 ...
GECCO
2003
Springer
13 years 10 months ago
2003
Springer
Estimation of Distribution Algorithms (EDAs) are new promising methods in the field of genetic and evolutionary algorithms. In the case of conventional Genetic and Evolutionary Al...
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...