Random Boolean Satisfiability function generators have recently been proposed as tools for studying genetic algorithm behavior. Yet MAXSAT problems exhibit extremely limited epistasis. Furthermore, all nonzero Walsh coefficients can be computed exactly for MAXSAT problems in polynomial time using only the clause information. This means the low order schema averages can be computed quickly and exactly for very large MAXSAT problems. But unless P=NP, this low order information cannot reliably lead to the global optimum, thus nontrivial MAXSAT problems must be deceptive.
CITATION STYLE
Rana, S., & Whitley, D. (1998). Genetic algorithm behavior in the MAXSAT domain. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1498 LNCS, pp. 785–794). Springer Verlag. https://doi.org/10.1007/bfb0056920
Mendeley helps you to discover research relevant for your work.