Polynomial complexity blackbox search: lessons from the SEARCH framework
暂无分享,去创建一个
[1] David J. Sirag,et al. Toward a unified thermodynamic genetic operator , 1987 .
[2] Helmut Ratschek,et al. What can interval analysis do for global optimization? , 1991, Journal of Global Optimization.
[3] D. Wolpert,et al. No Free Lunch Theorems for Search , 1995 .
[4] Günter Rudolph,et al. Massively Parallel Simulated Annealing and Its Relation to Evolutionary Algorithms , 1993, Evolutionary Computation.
[5] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .
[6] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[7] Alexander H. G. Rinnooy Kan,et al. Stochastic methods for global optimization , 1984 .
[8] Rich Caruana,et al. Removing the Genetics from the Standard Genetic Algorithm , 1995, ICML.
[9] Terry Jones,et al. Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms , 1995, ICGA.
[10] David E. Goldberg,et al. A Note on Boltzmann Tournament Selection for Genetic Algorithms and Population-Oriented Simulated Annealing , 1990, Complex Syst..
[11] Bruce E. Stuckman,et al. The rank transformation applied to a multi-univariate method of global optimization , 1990, IEEE 1989 International Conference on Systems Engineering.