Long Path Problems
暂无分享,去创建一个
[1] O. Antoine,et al. Theory of Error-correcting Codes , 2022 .
[2] Franco P. Preparata,et al. Difference-preserving codes , 1974, IEEE Trans. Inf. Theory.
[3] Schloss Birlinghoven,et al. How Genetic Algorithms Really Work I.mutation and Hillclimbing , 2022 .
[4] Melanie Mitchell,et al. Relative Building-Block Fitness and the Building Block Hypothesis , 1992, FOGA.
[5] Stewart W. Wilson. GA-Easy Does Not Imply Steepest-Ascent Optimizable , 1991, ICGA.
[6] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .
[7] John H. Holland,et al. When will a Genetic Algorithm Outperform Hill Climbing , 1993, NIPS.
[8] Gregory J. E. Rawlins,et al. Reverse HillclimbingGenetic Algorithms and the Busy Beaver Problem , 1993, ICGA.
[9] Lashon B. Booker,et al. Proceedings of the fourth international conference on Genetic algorithms , 1991 .
[10] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .
[11] Heinz Mühlenbein,et al. How Genetic Algorithms Really Work: Mutation and Hillclimbing , 1992, PPSN.