Sub-machine-code Genetic Programming

Created by W.Langdon from gp-bibliography.bib Revision:1.8051

@TechReport{poli:1998:smcGPtr,

• author = "Riccardo Poli and William B Langdon",
• title = "Sub-machine-code Genetic Programming",
• institution = "University of Birmingham, School of Computer Science",
• number = "CSRP-98-18",
• month = aug,
• year = "1998",
• keywords = "genetic algorithms, genetic programming",
• file = "/1998/CSRP-98-18.ps.gz",
• URL = "ftp://ftp.cs.bham.ac.uk/pub/tech-reports/1998/CSRP-98-18.ps.gz",
• abstract = "CPUs are often seen as sequential, however they have a high degree of internal parallelism, typically operating on 32 or 64 bits simultaneously. This paper explores the idea of exploiting this internal parallelism to extend the scope of genetic programming (GP) and improve its efficiency. We call the resulting form of GP sub-machine-code GP. The differences between sub-machine-code GP and the usual form of GP are purely semantic and largely language independent, i.e. any GP system can potentially be used to do sub-machine code GP. In this chapter this form of GP and some of its applications are presented. The speed up obtained with this technique on Boolean classification problems is nearly 2 orders of magnitude.",

}

Genetic Programming entries for Riccardo Poli William B Langdon

Citations