Created by W.Langdon from gp-bibliography.bib Revision:1.8081
target = x**9. 30 generations
RISC 296 MHz UltraSparc 2 https://en.wikipedia.org/wiki/SPARC
'reaching a maximum speedup of around 50 when the number of test cases is 1000.' 'The genome compiler, due to its use of machine code, achieves about an order of magnitude speedup over HiGP' \cite{stoffel:1996:hpsbGP}. 'The genome compiler performs roughly 50-60 times faster than 'Tackett and Carmi' SGPC \cite{sgpc_readme} running on the same machine, which is comparable to the execution speeds for CGPS reported by Nordin and Banzhaf \cite{Nordin:1995:tcp}.'
Lossless Image Compression future work 'compiler optimizations which use editing operations \cite{koza:book} or standard compiler optimization techniques to collapse instructions together, remove redundant operations, reorder operations, etc.,'
Thu, 25 Jun 1998 10:31:36 PDT We've recently developed a gp system based on lil-gp which evolves s-expressions and compiles it to machine code (specifically, Sparc machine code) to speed up evaluation. In our system, we've found that the overhead of compilation is negligible, since the vast majority of the time spent in execution in an s-expression interpreter (in our case, the lil-gp interpreter) is consumed by the recursive traversal of the tree.
A full description, comparisons with previous GP-compiler systems and some experimental results with symbolic regression and image compression are described",
Genetic Programming entries for Alex S Fukunaga Andre Stechert Darren Mutz