Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A Comparison of the Robustness of Evolutionary Computation and Random Walks.
 

Summary: A Comparison of the Robustness of
Evolutionary Computation and Random Walks.
Justin Schonfeld,
Bioinformatics and
Computational Biology Program,
Iowa State University,
Ames, Iowa 50011
schonfju@iastate.edu.
Daniel A. Ashlock,
Mathematics Department,
Iowa State University,
Ames, Iowa, 50011
danwell@iastate.edu.
Abstract-- Evolution and robustness are thought to
be intimately connected. Are solutions to optimization
problems produced by evolutionary algorithms more robust
to mutation than those produced by other classes of search
algorithms? We explore this question in a model system
based on bivariate real functions. Bivariate real functions
serve as a well understood model system that is easy

  

Source: Ashlock, Dan - Department of Mathematics and Statistics, University of Guelph

 

Collections: Mathematics