Evolutionary algorithms for chaos researchers

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

Výsledek na webu

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

Jazyk výsledku

angličtina

Název v původním jazyce

Evolutionary algorithms for chaos researchers

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Evolutionary algorithms for chaos researchers

Popis výsledku anglicky

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.

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

51

Strana od-do

37-88

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—