%0 Conference Paper
%B Springer Lecture Notes on Computer Science
%D 2002
%T Comparing Classical Methods for Solving Binary Constraint Satisfaction Problems with State of the Art Evolutionary Computation
%A van Hemert, J. I.
%E S. Cagnoni
%E J. Gottlieb
%E E. Hart
%E M. Middendorf
%E G. Raidl
%K constraint satisfaction
%X 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.
%B Springer Lecture Notes on Computer Science
%I Springer-Verlag, Berlin
%P 81--90
%G eng
%9 inproceedings