On Random Numbers and the Performance of Genetic Algorithms
暂无分享,去创建一个
[1] Thomas Bäck,et al. Generalized Convergence Models for Tournament- and (mu, lambda)-Selection , 1995, ICGA.
[2] Dirk Thierens,et al. Mixing in Genetic Algorithms , 1993, ICGA.
[3] Kalyanmoy Deb,et al. Analyzing Deception in Trap Functions , 1992, FOGA.
[4] David E. Goldberg,et al. Genetic Algorithms, Tournament Selection, and the Effects of Noise , 1995, Complex Syst..
[5] Zbigniew Michalewicz,et al. Evolutionary Computation 1 , 2018 .
[6] James A. Foster,et al. The Quality of Pseudo-Random Number Generations and Simple Genetic Algorithm Performance , 1997, ICGA.
[7] James A. Foster,et al. Random generator quality and GP performance , 1999 .
[8] Jason M. Daida,et al. Challenges with Verification, Repeatability, and Meaningful Comparison in Genetic Programming: Gibson's Magic , 1999, GECCO.
[9] Mark M. Meysenburg,et al. Randomness and GA performance, revisited , 1999 .
[10] Takuji Nishimura,et al. Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator , 1998, TOMC.
[11] Jason M. Daida,et al. Challenges with Verification, Repeatability, and Meaningful Comparisons in Genetic Programming , 1997 .
[12] Heinz Mühlenbein,et al. Predictive Models for the Breeder Genetic Algorithm I. Continuous Parameter Optimization , 1993, Evolutionary Computation.