Evolving computer programs using rapidly reconfigurable field-programmable gate arrays and genetic programming

20Citations
Citations of this article
28Readers
Mendeley users who have this article in their library.

Abstract

This paper describes how the massive parallelism of the rapidly reconfigurable Xilinx XC6216 FPGA (in conjunction with Virtual Computing's H.O.T. Works board) can be exploited to accelerate the time-consuming fitness measurement task of genetic algorithms and genetic programming. This acceleration is accomplished by embodying each individual of the evolving population into hardware in order to perform the fitness measurement task. A 16-step sorting network for seven items was evolved that has two fewer steps than the sorting network described in the 1962 O'Connor and Nelson patent on sorting networks (and the same number of steps as a 7-sorter that was devised by Floyd and Knuth subsequent to the patent and that is now known to be minimal). Other minimal sorters have been evolved.

Cite

CITATION STYLE

APA

Koza, J. R., Bennett, F. H., Hutchings, J. L., Bade, S. L., Keane, M. A., & Andre, D. (1998). Evolving computer programs using rapidly reconfigurable field-programmable gate arrays and genetic programming. In ACM/SIGDA International Symposium on Field Programmable Gate Arrays - FPGA (pp. 209–219). ACM. https://doi.org/10.1145/275107.275141

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