An Analysis about the Asymptotic Convergence of Evolutionary Algorithms
暂无分享,去创建一个
Lixin Ding | Jinghu Yu | L. Ding | Jinghu Yu
[1] G. Stewart. Introduction to matrix computations , 1973 .
[2] Günter Rudolph,et al. Convergence analysis of canonical genetic algorithms , 1994, IEEE Trans. Neural Networks.
[3] Michael D. Vose,et al. Modeling genetic algorithms with Markov chains , 1992, Annals of Mathematics and Artificial Intelligence.
[4] Joe Suzuki,et al. A Further Result on the Markov Chain Model of Genetic Algorithms and Its Application to a Simulated Annealing-like Strategy , 1998, FOGA.
[5] Michael D. Vose,et al. The simple genetic algorithm - foundations and theory , 1999, Complex adaptive systems.
[6] Lothar M. Schmitt,et al. Theory of genetic algorithms , 2001, Theor. Comput. Sci..
[7] Lishan Kang,et al. On the Convergence Rates of Genetic Algorithms , 1999, Theor. Comput. Sci..
[8] D. Cooke,et al. Finite Markov Processes and Their Applications , 1981 .
[9] Richard L. Tweedie,et al. Markov Chains and Stochastic Stability , 1993, Communications and Control Engineering Series.
[10] Alexandru Agapie,et al. Theoretical Analysis of Mutation-Adaptive Evolutionary Algorithms , 2001, Evolutionary Computation.
[11] R. Cerf. Asymptotic convergence of genetic algorithms , 1998, Advances in Applied Probability.
[12] Pedro Larrañaga,et al. Genetic Algorithms: Bridging the Convergence Gap , 1999, Theor. Comput. Sci..
[13] Riccardo Poli,et al. Schema Theory for Genetic Programming with One-Point Crossover and Point Mutation , 1997, Evolutionary Computation.
[14] Riccardo Poli,et al. Exact Schema Theory for Genetic Programming and Variable-Length Genetic Algorithms with One-Point Crossover , 2001, Genetic Programming and Evolvable Machines.