UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

Why “Building Blocks” Don’t Work on Parity Problems

Langdon, WB; Poli, R; (1998) Why “Building Blocks” Don’t Work on Parity Problems.

Full text not available from this repository.

Abstract

We investigate the distribution of performance of the parity and always-on Boolean functions given only the appropriate building block. These problems have “needle in a haystack” fitness landscape and so are unsuitable for genetic programming or other progressive search techniques. Theoretical analysis shows in the limit as program size grows the density of solutions is independent of size but falls exponentially with number of inputs.

Type: Report
Title: Why “Building Blocks” Don’t Work on Parity Problems
Publisher version: ftp://ftp.cs.bham.ac.uk/pub/tech-reports/1998/CSRP...
Additional information: keywords: genetic algorithms, genetic programming file: /1998/CSRP-98-17.ps.gz
UCL classification: UCL > Provost and Vice Provost Offices
UCL > Provost and Vice Provost Offices > UCL BEAMS
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science
URI: http://discovery.ucl.ac.uk/id/eprint/1327852
Downloads since deposit
0Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item