Caching for parallel linear genetic programming
Lists
Only you see this
Abstract
Parallel Linear Genetic Programming (PLGP) is an exciting new approach to Linear Genetic Programming (LGP) which decreases building block disruption and significantly improves performance by the introduction of a parallel architecture. We introduce a caching algorithm for PLGP which exploits this parallel architecture to avoid the majority of instruction executions. This allows PLGP programs to be executed an order of magnitude faster than LGP programs with an equal number of instructions.
BibTeX
@inproceedings{downey2011caching,
author = {Carlton Downey and Mengjie Zhang},
title = {{Caching for parallel linear genetic programming}},
booktitle = {GECCO (Companion)},
year = {2011},
doi = {10.1145/2001858.2001970},
}Loading related content...