Attributes | Values |
---|
rdf:type
| |
rdfs:seeAlso
| |
Description
| - 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 random processes really are 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 mathe- matical proofs. We propose that certain class of deterministic processes can be used instead of random number generators without lowering the performance of evolutionary algorithms.
- 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 random processes really are 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 mathe- matical proofs. We propose that certain class of deterministic processes can be used instead of random number generators without lowering the performance of evolutionary algorithms. (en)
|
Title
| - Do Evolutionary Algorithms Indeed Require Randomness?
- Do Evolutionary Algorithms Indeed Require Randomness? (en)
|
skos:prefLabel
| - Do Evolutionary Algorithms Indeed Require Randomness?
- Do Evolutionary Algorithms Indeed Require Randomness? (en)
|
skos:notation
| - RIV/61989100:27240/13:86088794!RIV14-GA0-27240___
|
http://linked.open...avai/predkladatel
| |
http://linked.open...avai/riv/aktivita
| |
http://linked.open...avai/riv/aktivity
| - P(ED2.1.00/03.0089), P(GA13-08195S), S
|
http://linked.open...vai/riv/dodaniDat
| |
http://linked.open...aciTvurceVysledku
| |
http://linked.open.../riv/druhVysledku
| |
http://linked.open...iv/duvernostUdaju
| |
http://linked.open...titaPredkladatele
| |
http://linked.open...dnocenehoVysledku
| |
http://linked.open...ai/riv/idVysledku
| - RIV/61989100:27240/13:86088794
|
http://linked.open...riv/jazykVysledku
| |
http://linked.open.../riv/klicovaSlova
| - Evolutionary algorithms, Randomness, Determinism, Chaos (en)
|
http://linked.open.../riv/klicoveSlovo
| |
http://linked.open...ontrolniKodProRIV
| |
http://linked.open...v/mistoKonaniAkce
| |
http://linked.open...i/riv/mistoVydani
| |
http://linked.open...i/riv/nazevZdroje
| - 2013 IEEE Congress on Evolutionary Computation, CEC 2013
|
http://linked.open...in/vavai/riv/obor
| |
http://linked.open...ichTvurcuVysledku
| |
http://linked.open...cetTvurcuVysledku
| |
http://linked.open...vavai/riv/projekt
| |
http://linked.open...UplatneniVysledku
| |
http://linked.open...iv/tvurceVysledku
| - Zelinka, Ivan
- Šenkeřík, Roman
- Pluháček, Michal
|
http://linked.open...vavai/riv/typAkce
| |
http://linked.open.../riv/zahajeniAkce
| |
number of pages
| |
http://bibframe.org/vocab/doi
| |
http://purl.org/ne...btex#hasPublisher
| |
https://schema.org/isbn
| |
http://localhost/t...ganizacniJednotka
| |