Genetic algorithm behavior in the MAXSAT domain

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1498 LNCS, Issue , 1998, Pages 785-794

  Rana, Soraya ^a   Whitley, Darrell ^a  

^a Department of Environmental and Radiological Health Sciences   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; POLYNOMIAL APPROXIMATION;

BOOLEAN SATISFIABILITY; GLOBAL OPTIMUM; LOW ORDER; MAX-SAT; MAX-SAT PROBLEMS; POLYNOMIAL-TIME; WALSH COEFFICIENTS;

GENETIC ALGORITHMS;

EID: 35248869999     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0056920     Document Type: Conference Paper

References (10)

1. P. Cheeseman, B. Kanefsky, and W. M. Taylor. Where the really hard problems are. In Proc. Twelfth International Joint Conference on Artificial Intelligence, 1991.
2. M. Davis and H Putnam. A computing procedure for quantification theory. Journal of the ACM, 7: 201-215, 1960.
3. J. Frank. A Study of Genetic Algorithms to Find Approximate Solutions to Hard 3CNF Problems. Golden West International Conference on Artificial Intelligence, 1994.
4. J. Frank, P. Cheeseman, and J. Stutz. When gravity fails: Local search topology. Journal of Artificial Intelligence Research, 7: 249-281, 1997.
5. D. Goldberg. Genetic algorithms and walsh functions: Part I, a gentle introduction. Complex Systems, 3: 129-152, 1989.
6. D. Goldberg. Genetic algorithms and walsh functions: Part II, deception and its analysis. Complex Systems, 3: 153-171, 1989.
7. D. Mitchell, B. Selman, and H. Levesque. Hard and easy distribution of sat problems. In Proc. Tenth National Conference on Artificial Intelligence, San Jose, CA, 1992.
8. S. Rana, R. Heckendorn, and D. Whitley. A tractable walsh analysis of Sat and its implications for genetic algorithms. In Proc. Fifteenth National Conference on Artificial Intelligence, 1998.
9. C. Reeves and C. Wright. Epistasis in genetic algorithms: An experimental design perspective. In Larry Eshelman, editor, Proceedings of the Sixth International Conference on Genetic Algorithms, pages 217-224. Morgan Kaufmann, 1995.
10. B. Selman, H. Levesque, and D. Mitchell. A new method for solving hard satisfiability problems. In Proc. Tenth National Conference on Artificial Intelligence, pages 440-446, San Jose, CA, 1992.