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”

Do Evolutionary Algorithms Indeed Require Random Numbers? Extended Study

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F13%3A86088782" target="_blank" >RIV/61989100:27240/13:86088782 - isvavai.cz</a>

  • Alternative codes found

    RIV/70883521:28140/13:43869790

  • Result on the web

    <a href="http://dx.doi.org/10.1007/978-3-319-00542-3_8" target="_blank" >http://dx.doi.org/10.1007/978-3-319-00542-3_8</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-319-00542-3_8" target="_blank" >10.1007/978-3-319-00542-3_8</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Do Evolutionary Algorithms Indeed Require Random Numbers? Extended Study

  • Original language description

    An inherent part of evolutionary algorithms, that are based on Darwin theory of evolution and Mendel theory of genetic heritage, are random processes. In this participation, we discuss whether are random processes really needed in evolutionary algorithms. We use n periodic deterministic processes instead of random number generators and compare performance of evolutionary algorithms powered by those processes and by pseudo-random number generators. Deterministic processes used in this participation are based on deterministic chaos and are used to generate periodical series with different length. Results presented here are numerical demonstration rather than mathematical proofs. We propose that a certain class of deterministic processes can be used instead of random number generators without lowering of evolutionary algorithms performance.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2013

  • 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

  • Article name in the collection

    Advances in Intelligent Systems and Computing. Volume 210

  • ISBN

    978-3-319-00541-6

  • ISSN

    2194-5357

  • e-ISSN

  • Number of pages

    15

  • Pages from-to

    61-75

  • Publisher name

    Springer

  • Place of publication

    Heidelberg

  • Event location

    Ostrava

  • Event date

    Jun 3, 2013

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article