Chaos synthesis by evolutionary algorithms

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

Chaos synthesis by evolutionary algorithms

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Chaos synthesis by evolutionary algorithms

Popis výsledku anglicky

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.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

BD - Teorie informace

OECD FORD obor

—

Projekt

—

Návaznosti

V - Vyzkumna aktivita podporovana z jinych verejnych zdroju

Rok uplatnění

2010

Kód důvěrnosti údajů

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

Název periodika

Studies in Computational Intelligence

ISSN

1860-949X

e-ISSN

—

Svazek periodika

267

Číslo periodika v rámci svazku

Neuveden

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

37

Strana od-do

345-382

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—