Sharpened and Focused No Free Lunch and Complexity Theory
作者： Darrell Whitley
DOI: 10.1007/978-1-4614-6940-7_16
关键词:
摘要: This tutorial reviews basic concepts in complexity theory, as well various No Free Lunch results and how these relate to computational complexity. The explains an informal fashion that illuminates key concepts. “No Lunch” theorems for search can be summarized by the following result:
springer.com
sci-hub.st 参考文章(32)
D. Whitley, A free lunch proof for Gray versus Binary encodings genetic and evolutionary computation conference. pp. 726- 733 ,(1999)
M. D. Vose, C. Schumacher, L. D. Whitley, The No Free Lunch and problem description length genetic and evolutionary computation conference. pp. 565- 570 ,(2001)
Ingo Wegener, Stefan Droste, Thomas Jansen, A New Framework for the Valuation of Algorithms for Black-Box-Optimization FOGA. pp. 253- 270 ,(2002) , 10.17877/DE290R-14196
Joseph Culberson, On the Futility of Blind Search ,(1996) , 10.7939/R3WP9T925
Thomas M. English, Practical Implications of New Results in Conservation of Optimizer Performance parallel problem solving from nature. pp. 69- 78 ,(2000) , 10.1007/3-540-45356-3_7
David H. Wolpert, William G. Macready, No Free Lunch Theorems for Search Research Papers in Economics. ,(1995)
D. Whitley, Functions as Permutations: Regarding No Free Lunch, Walsh Analysis and Summary Statistics parallel problem solving from nature. pp. 169- 178 ,(2000) , 10.1007/3-540-45356-3_17
Ingo Wegener, Stefan Droste, Thomas Jansen, Perhaps not a free lunch but at least a free appetizer genetic and evolutionary computation conference. pp. 833- 839 ,(1999) , 10.17877/DE290R-5018
Simon Fischer, Ingo Wegener, The Ising Model on the Ring: Mutation Versus Recombination genetic and evolutionary computation conference. pp. 1113- 1124 ,(2004) , 10.1007/978-3-540-24854-5_109
Sartaj Sahni, Ellis Horowitz, Fundamentals of Computer Algorithms ,(1983)