Created by W.Langdon from gp-bibliography.bib Revision:1.8620
http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/langdon_2021_EuroGP.pdf",
10.1007/978-3-030-72812-0_15",
https://youtu.be/2aiBUHFLo_s",
http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/gp-code/GPinc.tar.gz",
Considerable savings in bloated binary tree GP runs are given by exploiting population convergence with existing GPquick data structures, leading to near linear O(gens) runtime. With multi-threading and SIMD AVX parallel computing a 16 core desktop can deliver the equivalent of 571 billion GP operations per second, 571 giga GPop/s.
GP convergence is viewed via information theory as evolving a smooth landscape and software plasticity. Which gives rise to functional resilience to source code changes. On average a mixture of 100 +, -, multiply and (protected) division tree nodes remove test case effectiveness at exposing changes and so fail to propagate crossover infected errors.",
http://www.evostar.org/2021/eurogp/ Part of \cite{Hu:2021:GP} EuroGP'2021 held in conjunction with EvoCOP2021, EvoMusArt2021 and EvoApplications2021",
Genetic Programming entries for William B Langdon