The Role of Neutral and Adaptive Mutation in an
Evolutionary Search on the OneMax Problem
T. Yu, and J. Miller. Late Breaking Papers at the Genetic and Evolutionary
Computation Conference (GECCO-2002), page 512--519. New York, NY, AAAI, (July 2002)
Late Breaking Papers at the Genetic and Evolutionary
Computation Conference (GECCO-2002)
year
2002
month
July
pages
512--519
publisher
AAAI
notes
Late Breaking Papers, GECCO-2002. A joint meeting of
the eleventh International Conference on Genetic
Algorithms (ICGA-2002) and the seventh Annual Genetic
Programming Conference (GP-2002) part of
cantu-paz:2002:GECCO:lbp
OneMax, explicit versus implicit neutrality, analysis.
Variable mutation rate and neutrality. Success rate
increases with neutrality (Hamming distance)
Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 yu2:2002:gecco:lbp
%A Yu, Tina
%A Miller, Julian F.
%B Late Breaking Papers at the Genetic and Evolutionary
Computation Conference (GECCO-2002)
%C New York, NY
%D 2002
%E Cantú-Paz, Erick
%I AAAI
%K Cartesian algorithms, genetic neutrality programming,
%P 512--519
%T The Role of Neutral and Adaptive Mutation in an
Evolutionary Search on the OneMax Problem
@inproceedings{yu2:2002:gecco:lbp,
added-at = {2008-06-19T17:35:00.000+0200},
address = {New York, NY},
author = {Yu, Tina and Miller, Julian F.},
biburl = {https://www.bibsonomy.org/bibtex/2e4dcf2906b1abd4e6170d9d85baaf442/brazovayeye},
booktitle = {Late Breaking Papers at the Genetic and Evolutionary
Computation Conference ({GECCO-2002})},
editor = {Cant{\'u}-Paz, Erick},
interhash = {60912929b8f785e8b22e40447c9dfc93},
intrahash = {e4dcf2906b1abd4e6170d9d85baaf442},
keywords = {Cartesian algorithms, genetic neutrality programming,},
month = {July},
notes = {Late Breaking Papers, {GECCO-2002}. A joint meeting of
the eleventh International Conference on Genetic
Algorithms ({ICGA-2002}) and the seventh Annual Genetic
Programming Conference ({GP-2002}) part of
cantu-paz:2002:GECCO:lbp
OneMax, explicit versus implicit neutrality, analysis.
Variable mutation rate and neutrality. Success rate
increases with neutrality (Hamming distance)},
pages = {512--519},
publisher = {AAAI},
publisher_address = {445 Burgess Drive, Menlo Park, CA 94025},
timestamp = {2008-06-19T17:55:03.000+0200},
title = {The Role of Neutral and Adaptive Mutation in an
Evolutionary Search on the OneMax Problem},
year = 2002
}