Analysis of the (1+1) EA for a Dynamically Bitwise Changing OneMax - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Stefan Droste. Analysis of the (1+1) EA for a Dynamically Bitwise Changing OneMax. In Erick Cantú-Paz, James A. Foster, Kalyanmoy Deb, Lawrence Davis, Rajkumar Roy, Una-May O Reilly, Hans-Georg Beyer, Russell K. Standish, Graham Kendall, Stewart W. Wilson, Mark Harman, Joachim Wegener, Dipankar Dasgupta, Mitchell A. Potter, Alan C. Schultz, Kathryn A. Dowsland, Natasa Jonoska, Julian F. Miller, editors, Genetic and Evolutionary Computation - GECCO 2003, Genetic and Evolutionary Computation Conference, Chicago, IL, USA, July 12-16, 2003. Proceedings, Part I. Volume 2723 of Lecture Notes in Computer Science, pages 909-921, Springer, 2003. [doi]

The following publications are possibly variants of this publication:

Analysis of the (1+1) EA for a dynamically changing ONEMAX-variantStefan Droste. cec 2002: 55-60 [doi]

Analysis of the (1+1) EA for a Noisy OneMaxStefan Droste. gecco 2004: 1088-1099 [doi]

runs on WebDSL