All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

From Darwinian Evolution to Swarm Computation and Gamesourcing

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27740%2F19%3A10244899" target="_blank" >RIV/61989100:27740/19:10244899 - isvavai.cz</a>

  • Alternative codes found

    RIV/61989100:27240/19:10244899

  • Result on the web

    <a href="https://www.taylorfrancis.com/books/e/9781315167084/chapters/10.1201/9781315167084-7" target="_blank" >https://www.taylorfrancis.com/books/e/9781315167084/chapters/10.1201/9781315167084-7</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1201/9781315167084" target="_blank" >10.1201/9781315167084</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    From Darwinian Evolution to Swarm Computation and Gamesourcing

  • Original language description

    This chapter discusses how to generate a network reflecting the behavior of selected evolutionary and swarm algorithms as much as possible to make a thorough analysis of relationships between individuals in the population. Such analysis is considered to be the starting point in the process of development of enhanced algorithms, where the results of the analysis are incorporated. The chapter investigates if there is a connection between an individual with the best fitness value and a node with the highest out-degree. Clustering coefficients of short-interval networks (SIN) generated on the basis of the differential evolution (DE) algorithms are very small; however, there are statistically significant differences between clustering coefficients of networks generated on the basis of the different DE algorithms. The principle of SINs creation as well as the principle of DE algorithms has caused very low density of networks.

  • Czech name

  • Czech description

Classification

  • Type

    C - Chapter in a specialist book

  • CEP classification

  • OECD FORD branch

    10200 - Computer and information sciences

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2019

  • 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

    From Parallel to Emergent Computing

  • ISBN

    978-1-351-68191-9

  • Number of pages of the result

    42

  • Pages from-to

    135-176

  • Number of pages of the book

    608

  • Publisher name

    CRC Press

  • Place of publication

    Boca Raton

  • UT code for WoS chapter