On geometric and statistical properties of the attractors of a generic evolutionary algorithm
暂无分享,去创建一个
[1] Günter Rudolph,et al. Convergence analysis of canonical genetic algorithms , 1994, IEEE Trans. Neural Networks.
[2] A. Wright,et al. Markov chain models of genetic algorithms , 1999 .
[3] Kenneth A. De Jong,et al. Using Markov Chains to Analyze GAFOs , 1994, FOGA.
[4] Anthony Quas,et al. On Representations of Markov Chains by Random Smooth Maps , 1991 .
[5] Michael D. Vose,et al. The simple genetic algorithm - foundations and theory , 1999, Complex adaptive systems.
[6] Örjan Stenflo. Ergodic theorems for Markov chains represented by iterated function systems , 2001 .
[7] A. E. Eiben,et al. Global Convergence of Genetic Algorithms: A Markov Chain Analysis , 1990, PPSN.
[8] Günter Rudolph,et al. Finite Markov Chain Results in Evolutionary Computation: A Tour d'Horizon , 1998, Fundam. Informaticae.
[9] RudolphGünter. Finite Markov chain results in evolutionary computation , 1998 .
[10] John N. Tsitsiklis,et al. Introduction to Probability , 2002 .
[11] Charles M. Grinstead,et al. Introduction to probability , 1999, Statistics for the Behavioural Sciences.