Evolutionary algorithms for chaos researchers

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F70883521%3A28140%2F10%3A00001068" target="_blank" >RIV/70883521:28140/10:00001068 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-642-10707-8_2" target="_blank" >http://dx.doi.org/10.1007/978-3-642-10707-8_2</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-10707-8_2" target="_blank" >10.1007/978-3-642-10707-8_2</a>

Result language
angličtina
Original language name
Evolutionary algorithms for chaos researchers
Original language description
Evolutionary algorithms are search methods that can be used for solving optimization problems. They mimic working principles from natural evolution by employing a population?based approach, labeling each individual of the population with a fitness and including elements of random, albeit the random is directed through a selection process. In this chapter, we review the basic principles of evolutionary algorithms and discuss their purpose, structure and behavior. In doing so, it is particularly shown howthe fundamental understanding of natural evolution processes has cleared the ground for the origin of evolutionary algorithms. Major implementation variants and their structural as well as functional elements are discussed. We also give a brief overviewon usability areas of the algorithm and end with some general remarks of the limits of computing.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BD - Information theory
OECD FORD branch
—

Publication year
2010
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)