Advertisement

Walsh Functions and Predicting Problem Complexity

  • R. B. Heckendorn
Conference paper

Abstract

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.

Keywords

Genetic Algorithm Spectral Function Taylor Series Expansion Polynomial Complexity Simple Genetic Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    D.E. Goldberg. Genetic algorithms and walsh functions: Part I, a gentle introduction. Complex Systems, (3):129–152, 1989.Google Scholar
  2. [2]
    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
  3. [3]
    C. Reeves and C. Wright. An Experimental Design Perspective on Genetic Algorithms, Foundations of Genetic Algorithms, 3, Morgan Kaufmann Publishers, 1995.Google Scholar

Copyright information

© Springer-Verlag Wien 1998

Authors and Affiliations

  • R. B. Heckendorn
    • 1
  1. 1.Department of Computer ScienceColorado State UniversityFort CollinsUSA

Personalised recommendations