Bit Representations with a Twist
暂无分享,去创建一个
[1] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[2] L. Darrell Whitley,et al. Representation, Search and Genetic Algorithms , 1997, AAAI/IAAI.
[3] D. Wolpert,et al. No Free Lunch Theorems for Search , 1995 .
[4] L. Darrell Whitley,et al. Evaluating Evolutionary Algorithms , 1996, Artif. Intell..
[5] Heinz Mühlenbein,et al. Evolution in Time and Space - The Parallel Genetic Algorithm , 1990, FOGA.
[6] L. Darrell Whitley,et al. Search, Binary Representations and Counting Optima , 1999 .
[7] L. Darrell Whitley,et al. Changing Representations During Search: A Comparative Study of Delta Coding , 1994, Evolutionary Computation.
[8] F. Glover. Tabu Search Fundamentals and Uses , 1995 .
[9] Lawrence Davis,et al. Bit-Climbing, Representational Bias, and Test Suite Design , 1991, ICGA.
[10] Jorge J. Moré,et al. Testing Unconstrained Optimization Software , 1981, TOMS.
[11] Schloss Birlinghoven. Evolution in Time and Space -the Parallel Genetic Algorithm , 1991 .
[12] Patrick D. Surry,et al. Fundamental Limitations on Search Algorithms: Evolutionary Computing in Perspective , 1995, Computer Science Today.