Simple Explanation of the No-Free-Lunch Theorem and Its Implications
暂无分享,去创建一个
[1] David G. Stork,et al. Pattern Classification , 1973 .
[2] L. Dai. Convergence properties of ordinal comparison in the simulation of discrete event dynamic systems , 1995 .
[3] D. Wolpert,et al. No Free Lunch Theorems for Search , 1995 .
[4] Patrick D. Surry,et al. Fundamental Limitations on Search Algorithms: Evolutionary Computing in Perspective , 1995, Computer Science Today.
[5] Joseph Culberson. On the Futility of Blind Search , 1996 .
[6] David H. Wolpert,et al. No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..
[7] Joseph C. Culberson,et al. On the Futility of Blind Search: An Algorithmic View of No Free Lunch , 1998, Evolutionary Computation.
[8] L.G. Bushnell,et al. Report on the fuzzy versus conventional control debate , 1999, IEEE Control Systems.
[9] Oliver Sharpe. Continuing beyond NFL: dissecting real world problems , 1999 .
[10] Yu-Chi Ho,et al. An Explanation of Ordinal Optimization: Soft Computing for hard Problems , 1999, Inf. Sci..
[11] Yu-Chi Ho. The no free lunch theorem and the human-machine interface , 1999 .
[12] A Gordon,et al. Classification, 2nd Edition , 1999 .
[13] D. Du,et al. Theory of Computational Complexity , 2000 .
[14] David G. Stork,et al. Pattern classification, 2nd Edition , 2000 .
[15] David H. Wolpert,et al. Remarks on a recent paper on the "no free lunch" theorems , 2001, IEEE Trans. Evol. Comput..