Hardware accelerators for cartesian genetic programming

27Citations
Citations of this article
29Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A new class of FPGA-based accelerators is presented for Cartesian Genetic Programming (CGP). The accelerators contain a genetic engine which is reused in all applications. Candidate programs (circuits) are evaluated using application-specific virtual reconfigurable circuit (VRC) and fitness unit. Two types of VRCs are proposed. The first one is devoted for symbolic regression problems over the fixed point representation. The second one is designed for evolution of logic circuits. In both cases a significant speedup of evolution (30-40 times) was obtained in comparison with a highly optimized software implementation of CGP. This speedup can be increased by creating multiple fitness units. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Vasicek, Z., & Sekanina, L. (2008). Hardware accelerators for cartesian genetic programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4971 LNCS, pp. 230–241). https://doi.org/10.1007/978-3-540-78671-9_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free