Predicting Speedups of Ideal Bounding Cases of Parallel Genetic Algorithms
暂无分享,去创建一个
[1] John H. Holland,et al. Distributed genetic algorithms for function optimization , 1989 .
[2] Erick Cantú-Paz,et al. A summary of Research on Parallel Genetic Algorithms , 1995 .
[3] David E. Goldberg,et al. The Gambler's Ruin Problem, Genetic Algorithms, and the Sizing of Populations , 1999, Evolutionary Computation.
[4] Theodore C. Belding,et al. The Distributed Genetic Algorithm Revisited , 1995, ICGA.
[5] Allan Gottlieb,et al. Highly parallel computing (2nd ed.) , 1994 .
[6] Kalyanmoy Deb,et al. A Comparative Analysis of Selection Schemes Used in Genetic Algorithms , 1990, FOGA.
[7] Erick Cantú-Paz,et al. Modeling Idealized Bounding Cases of Parallel Genetic Algorithms , 1996 .
[8] Allan Gottlieb,et al. Highly parallel computing , 1989, Benjamin/Cummings Series in computer science and engineering.
[9] Reiko Tanese,et al. Distributed Genetic Algorithms , 1989, ICGA.
[10] Kalyanmoy Deb,et al. Genetic Algorithms, Noise, and the Sizing of Populations , 1992, Complex Syst..
[11] Takeshi Yamada,et al. Optimal Population Size under Constant Computation Cost , 1994, PPSN.