Walsh Functions and Predicting Problem Complexity
Theorems axe given establishing the epistatic bounds for problems that can be stated as mathematical expressions. Examples of the application of the theorems and techniques for controlling epistasis are presented.
KeywordsGenetic Algorithm Spectral Function Taylor Series Expansion Polynomial Complexity Simple Genetic Algorithm
Unable to display preview. Download preview PDF.
- D.E. Goldberg. Genetic algorithms and walsh functions: Part I, a gentle introduction. Complex Systems, (3):129–152, 1989.Google Scholar
- R. B. Heckendorn, D. Whitley, and S. Rana. Nonlinearity, Hyperplane Ranking and the Simple Genetic Algorithms, Foundations of Genetic Algorithms, 4, Morgan Kaufmann Publishers, 1997.Google Scholar
- C. Reeves and C. Wright. An Experimental Design Perspective on Genetic Algorithms, Foundations of Genetic Algorithms, 3, Morgan Kaufmann Publishers, 1995.Google Scholar