Evolutionary Dynamics and Its Network Visualization-Selected Examples
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F18%3A10241923" target="_blank" >RIV/61989100:27240/18:10241923 - isvavai.cz</a>
Alternative codes found
RIV/61989100:27740/18:10241923
Result on the web
<a href="https://link.springer.com/chapter/10.1007/978-3-662-55663-4_2" target="_blank" >https://link.springer.com/chapter/10.1007/978-3-662-55663-4_2</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Evolutionary Dynamics and Its Network Visualization-Selected Examples
Original language description
In this chapter is demonstrated, on selected algorithms, how can be converted dynamics of the evolutionary process into a network. Selected algorithms are a self-organizing migrating algorithm, differential evolution, particle swarm, artificial bee colony and ant colony optimization. The main ideas and steps are discussed here, for more detailed study and understanding references to original research papers are throughout the text. The aim of this chapter is to show principles of conversion with attention on the fact that there is no universal guide on how to do conversion - it is a matter of creative approach and algorithm knowledge.
Czech name
—
Czech description
—
Classification
Type
C - Chapter in a specialist book
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2018
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Book/collection name
Evolutionary Algorithms, Swarm Dynamics and Complex Networks
ISBN
978-3-662-55661-0
Number of pages of the result
33
Pages from-to
31-63
Number of pages of the book
312
Publisher name
Springer, Berlin, Heidelberg
Place of publication
Germany
UT code for WoS chapter
—