Langdon, WB;
Banzhaf, W;
(2019)
Continuous Long-Term Evolution of Genetic Programming.
In: Fellermann, H and Bacardit, J and Goñi-Moreno, Á and Füchslin, RM, (eds.)
ALIFE 2019: Proceedings of the Artificial Life Conference 2019.
(pp. pp. 388-395).
MIT Press: Newcastle, UK.
Preview |
Text
Langdon_2019_alife.pdf - Accepted Version Download (685kB) | Preview |
Abstract
We evolve floating point Sextic polynomial populations of genetic programming binary trees for up to a million generations. Programs with almost 400 000 000 instructions are created by crossover. To support unbounded Long-Term Evolution Experiment LTEE GP we use both SIMD parallel AVX 512 bit instructions and 48 threads to yield performance of up to 149 billion GP operations per second, 149 giga GPops, on a single Intel Xeon Gold 6126 2.60 GHz server.
| Type: | Proceedings paper |
|---|---|
| Title: | Continuous Long-Term Evolution of Genetic Programming |
| Event: | ALIFE 2019: The 2019 Conference on Artificial Life |
| Open access status: | An open access version is available from UCL Discovery |
| DOI: | 10.1162/isal_a_00191 |
| Publisher version: | https://doi.org/10.1162/isal_a_00191 |
| Language: | English |
| Additional information: | © 2019 Massachusetts Institute of Technology Published under a Creative Commons Attribution 4.0 International (CC BY 4.0) license (https://creativecommons.org/licenses/by/4.0/) |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science |
| URI: | https://discovery.ucl.ac.uk/id/eprint/10100131 |
Archive Staff Only
 |
View Item |
