Functions as permutations: Regarding No Free Lunch, walsh analysis and summary statistics

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

Volumn 1917, Issue , 2000, Pages 169-178

  Whitley, D ^a  

^a Department of Computer Science   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EQUIVALENCE CLASSES;

NO FREE LUNCH; PARAMETER SET; SCHEMA INFORMATION; SEARCH ALGORITHMS; SEARCH PROBLEM; SEARCH SPACES; SUMMARY STATISTIC; WALSH COEFFICIENTS;

FUNCTION EVALUATION;

EID: 84947922356     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45356-3_17     Document Type: Conference Paper

References (14)

1. [1] L. Barbulescu, J.P. Watson, and D. Whitley. Dynamic representations and escaping local optima. In 17th National Conf. on Artificial Intelligence (AAAI), 2000.
2. [2] J. Culberson. On the Futility of Blind Search. Evolutionary Computation, 6(2):109-127, 1999.
3. [3] D. Goldberg. Genetic Algorithms and Walsh Functions: Part I, A Gentle Introduction. Complex Systems, 3:129-152, 1989.
4. [4] D. Goldberg. Genetic Algorithms and Walsh Functions: Part II, Deception and its Analysis. Complex Systems, 3:153-171, 1989.
5. [5] D. Goldberg and M. Rudnick. Genetic algorithms and the variance of fitness. Complex Systems, 5(3):265-278, 1991.
6. [6] R. Heckendorn, S. Rana, and D. Whitley. Polynomial time summary statistics for a generalization of MAXSAT. GECCO-99, Morgan Kaufmann, 1999.
7. [7] R. Heckendorn, S. Rana, and D. Whitley. Test Function Generators as Embedded Landscapes. In Foundations of Genetic Algorithms FOGA-5. Morgan Kaufmann, 1999.
8. [8] S.A. Kauffman. Adaptation on Rugged Fitness Landscapes. Lectures in the Science of Complexity, pages 527-618. Addison-Wesley, 1989.
9. [9] N.J. Radcliffe and P.D. Surry. Fundamental limitations on search algorithms: Evolutionary computing in perspective. Lecture Notes in Computer Science 1000. Springer-Verlag, 1995.
10. [10] S. Rana and D. Whitley. Bit Representations with a Twist. 7th International Conf. on GAs (ICGA), Morgan Kaufmann, 1997.
11. [11] S. Rana and D. Whitley. Search, representation and counting optima. IMA Workshop on Evolutionary Algorithms. Springer-Verlag, 1998.
12. [12] C. Reeves and C. Wright. An Experimental Design Perspective on Genetic Algorithms. In FOGA - 3, pages 7-22. Morgan Kaufmann, 1995.
13. [13] C.A. Tovey. Hill climbing and multiple local optima. SIAM Journal on Algebraic and Discrete Methods, 6(3):384-393, July 1985.
14. [14] D.H. Wolpert and W.G. Macready. No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 4:67-82, 1997.