论文信息 - No free lunch: 1995-2008 - 字舞流文

No free lunch: 1995-2008

All search algorithms are equivalent when compared over all possible discrete functions. All search algorithms are equivalent when compared over all possible representations.

L. Darrell Whitley

[1] Thomas Jansen,et al. Optimization with randomized search heuristics - the (A)NFL theorem, realistic scenarios, and difficult functions , 2002, Theor. Comput. Sci..

[2] Patrick D. Surry,et al. Fundamental Limitations on Search Algorithms: Evolutionary Computing in Perspective , 1995, Computer Science Today.

[3] D. Wolpert,et al. No Free Lunch Theorems for Search , 1995 .

[4] Thomas M. English. Practical Implications of New Results in Conservation of Optimizer Performance , 2000, PPSN.

[5] Joseph C. Culberson,et al. On the Futility of Blind Search: An Algorithmic View of No Free Lunch , 1998, Evolutionary Computation.

[6] Joseph Culberson. On the Futility of Blind Search , 1996 .

[7] Steffen Christensen,et al. What can we learn from No Free Lunch? a first attempt to characterize the concept of a searchable function , 2001 .

[8] L. Darrell Whitley,et al. Functions as Permutations: Regarding No Free Lunch, Walsh Analysis and Summary Statistics , 2000, PPSN.

[9] David H. Wolpert,et al. No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[10] L. D. Whitley,et al. The No Free Lunch and problem description length , 2001 .

[11] Thomas Jansen,et al. Design and Management of Complex Technical Processes and Systems by Means of Computational Intelligence Methods Perhaps Not a Free Lunch but at Least a Free Appetizer Perhaps Not a Free Lunch but at Least a Free Appetizer , 2022 .