TY  - CONF
T1  - Comparing Classical Methods for Solving Binary Constraint Satisfaction Problems with State of the Art Evolutionary Computation
T2  - Springer Lecture Notes on Computer Science
Y1  - 2002
A1  - van Hemert, J. I.
ED  - S. Cagnoni
ED  - J. Gottlieb
ED  - E. Hart
ED  - M. Middendorf
ED  - G. Raidl
KW  - constraint satisfaction
AB  - Constraint Satisfaction Problems form a class of problems that are generally computationally difficult and have been addressed with many complete and heuristic algorithms. We present two complete algorithms, as well as two evolutionary algorithms, and compare them on randomly generated instances of binary constraint satisfaction prob-lems. We find that the evolutionary algorithms are less effective than the classical techniques.
JF  - Springer Lecture Notes on Computer Science
PB  - Springer-Verlag, Berlin
ER  -