Revisiting the GEMGA: scalable evolutionary optimization through linkage learning
暂无分享,去创建一个
[1] Kalyanmoy Deb,et al. Messy Genetic Algorithms: Motivation, Analysis, and First Results , 1989, Complex Syst..
[2] David E. Goldberg,et al. SEARCH, Blackbox Optimization, And Sample Complexity , 1996, FOGA.
[3] H. Mühlenbein,et al. From Recombination of Genes to the Estimation of Distributions I. Binary Parameters , 1996, PPSN.
[4] Hillol Kargupta. Gene expression: The missing link in evolutionary computation , 1997 .
[5] Hillol Kargupta,et al. The performance of the gene expression messy genetic algorithm on real test functions , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.
[6] D. Ackley. A connectionist machine for genetic hillclimbing , 1987 .
[7] K. Deb. Binary and floating-point function optimization using messy genetic algorithms , 1991 .
[8] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .
[9] H. Kargupta. Search, polynomial complexity, and the fast messy genetic algorithm , 1996 .
[10] Hillol Kargupta,et al. The Gene Expression Messy Genetic Algorithm , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.
[11] Kalyanmoy Deb,et al. RapidAccurate Optimization of Difficult Problems Using Fast Messy Genetic Algorithms , 1993, ICGA.
[12] S. Baluja,et al. Using Optimal Dependency-Trees for Combinatorial Optimization: Learning the Structure of the Search Space , 1997 .