No free lunch theorems for optimization

IEEE Transactions on Evolutionary Computation - Tập 1 Số 1 - Trang 67-82 - 1997
David H. Wolpert1, William G. Macready1,2
1IBM Almaden Research Center San Jose CA USA
2Santa Fe Institute, Santa Fe, NM, USA

Tóm tắt

Từ khóa


Tài liệu tham khảo

kinderman, 1980, Markov Random Fields and Their Applications, 10.1090/conm/001

10.1162/neco.1996.8.7.1341

wolpert, 1996, on bias plus variance, Neural Computation, 9, 1271

griffeath, 1976, introduction to random fields, Denumerable Markov Chains, 10.1007/978-1-4684-9455-6_12

strauss, 1992, alpha, evidence, and the entropic prior, Maximum Entropy and Bayesian Methods, 113

cover, 1991, Elements of Information Theory, 10.1002/0471200611

kirkpatrick, 1983, optimization by simulated annealing, Science, 220, 671, 10.1126/science.220.4598.671

schwefel, 1995, Evolution and Optimum Seeking

wolpert, 1995, No free lunch theorems for search

10.1002/cplx.6130010511

10.1287/ijoc.2.1.4

10.1287/ijoc.1.3.190

holland, 1993, Adaptations in Natural and Artificial Systems

fogel, 1966, Artificial Intelligence Through Simulated Evolution

10.1287/opre.14.4.699