Evolutionary Algorithms for Chaos Researchers

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F10%3A86075792" target="_blank" >RIV/61989100:27240/10:86075792 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

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 popula- tion with a fitness andincluding elements of random, albeit the random is directed through a selection process. In this chapter, we review the basic principles of evo- lutionary algorithms and discuss their purpose, structure and behavior. In doing so, it is particularly shownhow the 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 overview on 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 popula- tion with a fitness andincluding elements of random, albeit the random is directed through a selection process. In this chapter, we review the basic principles of evo- lutionary algorithms and discuss their purpose, structure and behavior. In doing so, it is particularly shownhow the 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 overview on usability areas of the algorithm and end with some general remarks of the limits of computing.

Druh

C - Kapitola v odborné knize

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

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 knihy nebo sborníku

Evolutionary Algorithms and Chaotic Systems

ISBN

978-3-642-10706-1

Počet stran výsledku

52

Strana od-do

—

Počet stran knihy

523

Název nakladatele

Springer-Verlag

Místo vydání

Heidelberg

Kód UT WoS kapitoly

—