Main menu
You are here
Historical Interest Only
This is a static HTML version of an old Drupal site. The site is no longer maintained and could be deleted at any point. It is only here for historical interest.
Comparing Classical Methods for Solving Binary Constraint Satisfaction Problems with State of the Art Evolutionary Computation
23 August 2007 - 1:54pm — Jano.van.Hemert
| Title | Comparing Classical Methods for Solving Binary Constraint Satisfaction Problems with State of the Art Evolutionary Computation |
| Publication Type | Conference Paper |
| Year of Publication | 2002 |
| Authors | van Hemert, JI |
| Conference Name | Springer Lecture Notes on Computer Science |
| Publisher | Springer-Verlag, Berlin |
| Editor | Cagnoni, S, Gottlieb, J, Hart, E, Middendorf, M, Raidl, G |
| Keywords | constraint satisfaction |
| Abstract | 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. |
| Full Text |
