Computable bounds on the rate of convergence in evolutionary computation
暂无分享,去创建一个
[1] Joe Suzuki,et al. A Markov chain analysis on simple genetic algorithms , 1995, IEEE Trans. Syst. Man Cybern..
[2] José Carlos Príncipe,et al. A Markov Chain Framework for the Simple Genetic Algorithm , 1993, Evolutionary Computation.
[3] A. E. Eiben,et al. Global Convergence of Genetic Algorithms: A Markov Chain Analysis , 1990, PPSN.
[4] Michael D. Vose. Logarithmic Convergence of Random Heuristic Search , 1996, Evolutionary Computation.
[5] Günter Rudolph,et al. Finite Markov Chain Results in Evolutionary Computation: A Tour d'Horizon , 1998, Fundam. Informaticae.
[6] Hans-Georg Beyer,et al. Toward a Theory of Evolution Strategies: On the Benefits of Sex the (/, ) Theory , 1995, Evolutionary Computation.
[7] XI FachbereichInformatik. Finite Markov Chain Results in Evolutionary Computation: a Tour D'horizon , 1998 .
[8] Gian Luigi Ferrari,et al. Parameterized Structured Operational Semantics , 1998, Fundam. Informaticae.
[9] J. Spall,et al. Some theoretical comparisons of stochastic optimization approaches , 2000, Proceedings of the 2000 American Control Conference. ACC (IEEE Cat. No.00CH36334).
[10] Günter Rudolph,et al. Convergence of evolutionary algorithms in general search spaces , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.
[11] Günter Rudolph,et al. Convergence analysis of canonical genetic algorithms , 1994, IEEE Trans. Neural Networks.
[12] Gunar E. Liepins,et al. Punctuated Equilibria in Genetic Search , 1991, Complex Syst..