Solving Satisfiability Problems with Genetic Algorithms
2000
Book Chapter
ei
We show how to solve hard 3-SAT problems using genetic algorithms. Furthermore, we explore other genetic operators that may be useful to tackle 3-SAT problems, and discuss their pros and cons.
Author(s): | Harmeling, S. |
Book Title: | Genetic Algorithms and Genetic Programming at Stanford 2000 |
Pages: | 206-213 |
Year: | 2000 |
Month: | June |
Day: | 0 |
Editors: | Koza, J. R. |
Publisher: | Stanford Bookstore |
Department(s): | Empirische Inferenz |
Bibtex Type: | Book Chapter (inbook) |
Address: | Stanford, CA, USA |
Digital: | 0 |
Institution: | Genetic |
Language: | en |
Organization: | Max-Planck-Gesellschaft |
School: | Biologische Kybernetik |
Links: |
PDF
|
BibTex @inbook{6366, title = {Solving Satisfiability Problems with Genetic Algorithms}, author = {Harmeling, S.}, booktitle = {Genetic Algorithms and Genetic Programming at Stanford 2000}, pages = {206-213}, editors = {Koza, J. R.}, publisher = {Stanford Bookstore}, organization = {Max-Planck-Gesellschaft}, institution = {Genetic}, school = {Biologische Kybernetik}, address = {Stanford, CA, USA}, month = jun, year = {2000}, doi = {}, month_numeric = {6} } |