Institutional Research Information Service
UCL Logo
Please report any queries concerning the funding data grouped in the sections named "Externally Awarded" or "Internally Disbursed" (shown on the profile page) to your Research Finance Administrator. Your can find your Research Finance Administrator at https://www.ucl.ac.uk/finance/research/rs-contacts.php by entering your department
Please report any queries concerning the student data shown on the profile page to:

Email: portico-services@ucl.ac.uk

Help Desk: http://www.ucl.ac.uk/ras/portico/helpdesk
Publication Detail
Solving Even-12, -13, -15, -17, -20 and -22 Boolean Parity Problems using Sub-machine Code GP with Smooth Uniform Crossover, Smooth Point Mutation and Demes
In this paper we describe a recipe to solve very large parity problems, using GP without automatically defined functions. The recipe includes three main ingredients: smooth uniform crossover (a crossover operator inspired by theoretical research), sub-machine-code GP (a technique which allows speeding up fitness evaluation in Boolean classification problems by nearly 2 orders of magnitude), and distributed demes (weakly interacting sub-populations running on separate workstations). We tested this recipe on parity problems with up to 22 input variables (i.e. where the fitness function includes 2^22=4,194,304 fitness cases), solving them with a very high success probability.
Publication data is maintained in RPS. Visit https://rps.ucl.ac.uk
 More search options
UCL Researchers
Dept of Computer Science
University College London - Gower Street - London - WC1E 6BT Tel:+44 (0)20 7679 2000

© UCL 1999–2011

Search by