POOL-WISE CROSSOVER IN GENETIC ALGORITHMS : AN INFORMATION-THEORETIC VIEW
暂无分享,去创建一个
[1] Shumeet Baluja,et al. Genetic Algorithms and Explicit Search Statistics , 1996, NIPS.
[2] Paul A. Viola,et al. MIMIC: Finding Optima by Estimating Probability Densities , 1996, NIPS.
[3] Rich Caruana,et al. Removing the Genetics from the Standard Genetic Algorithm , 1995, ICML.
[4] Gilbert Syswerda,et al. Uniform Crossover in Genetic Algorithms , 1989, ICGA.
[5] C. Chow,et al. Approximating discrete probability distributions with dependence trees , 1968, IEEE Trans. Inf. Theory.
[6] Shumeet Baluja,et al. An Empirical Comparison of Seven Iterative and Evolutionary Heuristics for Static Function Optimization ( Extended Abstract ) , 2002 .
[7] Keith E. Mathias,et al. Convergence Controlled Variation , 1996, FOGA.
[8] A. Juels,et al. Topics in black-box combinatorial optimization , 1996 .
[9] David Heckerman,et al. Learning Bayesian Networks: Search Methods and Experimental Results , 1995 .
[10] Martin Pelikan,et al. Hill Climbing with Learning (An Abstraction of Genetic Algorithm) , 1995 .
[11] Gilbert Syswerda,et al. Simulated Crossover in Genetic Algorithms , 1992, FOGA.
[12] Judea Pearl,et al. Probabilistic reasoning in intelligent systems , 1988 .
[13] Mandayam A. L. Thathachar,et al. Learning Optimal Discriminant Functions through a Cooperative Game of Automata , 1987, IEEE Transactions on Systems, Man, and Cybernetics.