Zobrazeno 1 - 10
of 294
pro vyhledávání: '"LANGDON, W"'
Autor:
Langdon, W. B.
We summarise how a 3.0 GHz 16 core AVX512 computer can interpret the equivalent of up to on average 1103370000000 GPop/s. Citations to existing publications are given. Implementation stress is placed on both parallel computing, bandwidth limits and a
Externí odkaz:
http://arxiv.org/abs/2205.03251
Publikováno v:
Entomologist's Record & Journal of Variation. Jul/Aug2024, Vol. 136 Issue Part 4, p205-208. 4p.
Autor:
Langdon, W. B.
Information theoretic analysis of large evolved programs produced by running genetic programming for up to a million generations has shown even functions as smooth and well behaved as floating point addition and multiplication loose entropy and conse
Externí odkaz:
http://arxiv.org/abs/2112.00812
Autor:
Langdon, W. B.
C++ code snippets from a multi-core parallel memory-efficient crossover for genetic programming are given. They may be adapted for separate generation evolutionary algorithms where large chromosomes or small RAM require no more than M + (2 times nthr
Externí odkaz:
http://arxiv.org/abs/2009.10460
Autor:
Langdon, W. B., Banzhaf, W.
We evolve floating point Sextic polynomial populations of genetic programming binary trees for up to a million generations. Programs with almost four hundred million instructions are created by crossover. To support unbounded Long-Term Evolution Expe
Externí odkaz:
http://arxiv.org/abs/1902.09215
Autor:
Langdon, W. B.
Report on Humies competition at GECCO 2018 in Japan
Comment: To appear in SIGEVOlution
Comment: To appear in SIGEVOlution
Externí odkaz:
http://arxiv.org/abs/1810.09416
Autor:
Langdon, W. B.
The distribution of reversible programs tends to a limit as their size increases. For problems with a Hamming distance fitness function the limiting distribution is binomial with an exponentially small chance (but non~zero) chance of perfect solution
Externí odkaz:
http://arxiv.org/abs/1808.06928
Autor:
Langdon, W. B.
We evolve binary mux-6 trees for up to 100000 generations evolving some programs with more than a hundred million nodes. Our unbounded Long-Term Evolution Experiment LTEE GP appears not to evolve building blocks but does suggests a limit to bloat. We
Externí odkaz:
http://arxiv.org/abs/1703.08481
Autor:
Langdon, W. B., Lam, Brian Yee Hong
Publikováno v:
BioData Mining 10:28, 2 August, 2017
BarraCUDA is a C program which uses the BWA algorithm in parallel with nVidia CUDA to align short next generation DNA sequences against a reference genome. The genetically improved (GI) code is up to three times faster on short paired end reads from
Externí odkaz:
http://arxiv.org/abs/1505.07855
Autor:
Langdon, W. B., Harman, M.
We study a generic program to investigate the scope for automatically customising it for a vital current task, which was not considered when it was first written. In detail, we show genetic programming (GP) can evolve models of aspects of BLAST's out
Externí odkaz:
http://arxiv.org/abs/1306.5667