A tractable walsh analysis of sat and its implications for genetic algorithms (1998) [8 citations — 4 self]
by Soraya Rana, Robert B. Heckendorn, Darrell Whitley
In Proceedings of the AAAI-98
http://www.cs.colostate.edu/~genitor/1998/aaai98.ps.gz
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Rana98atractable,author = {Soraya Rana and Robert B. Heckendorn and Darrell Whitley},
title = {A tractable walsh analysis of sat and its implications for genetic algorithms},
booktitle = {In Proceedings of the AAAI-98},
year = {1998},
publisher = {AAAI Press}
}
Years of Citing Articles
Abstract:
Walsh Transforms measure all sources of nonlinear interactions for functions that have a bit representation. There can be exponentially many nonlinear interactions and exactly computing all Walsh coefficients is usually intractable for non-trivial functions. In this paper we will show that SAT problems evaluated as MAXSAT functions have a highly restricted set of nonzero Walsh coefficients and those coefficients can be computed in linear time with respect to the number of clauses. This analysis suggests why standard simple genetic algorithms should perform poorly on MAXSAT problems.
Citations
| 1827 | Adaptation in nature and artificial system – Holland - 1992 |
| 383 | Some optimal inapproximability results – HËšastad |
| 136 | Genetic algorithms and Walsh functions: Part I, a gentle introduction – Goldberg - 1989 |
| 17 | Epistasis in genetic algorithms: An experimental design perspective – Reeves, Wright - 1995 |
