Chaos synthesis by evolutionary algorithms

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

Result language
angličtina
Original language name
Chaos synthesis by evolutionary algorithms
Original language description
This chapter introduces the notion of chaos synthesis by means of evolutionary algorithms and develops a new method for chaotic systems synthesis. This method is similar to genetic programming and grammatical evolution and is applied alongside evolutionary algorithms: differential evolution, self-organizing migrating, genetic algorithm, simulated annealing and evolutionary strategies. The aim of this investigation is to synthesize new and ?simple? chaotic systems based on some elements contained in a pre-chosen existing chaotic system and a properly defined cost function. The investigation consists of two case studies based on the aforementioned evolutionary algorithms in various versions. For all algorithms, 100 simulations of chaos synthesis were repeated and then averaged to guarantee the reliability and robustness of the proposed method. The most significant results are carefully selected, visualized and commented in this chapter.
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)