Created by W.Langdon from gp-bibliography.bib Revision:1.8129
Using 6-multiplexor problem shows using a syntax (of the correct sort, specified using a context free grammar) to constrain the form of the program trees helps GP solve the problem. More restrictions, easier it is.
Then presents a method based on the syntax of the fitest member of the population to modify the grammar whilst the GP runs. Shows improvement on 6-multiplexor. Still greater improvements obtained by introducing a fitness for rules within the grammar. This weakly biases the grammar, ie all legal program are still legal, but now some are more likley to be produced than they where before the fitness of the grammar rules where changed.
10\% of population each generation regenerated using his {"}replacement{"} operator.",
Genetic Programming entries for Peter Alexander Whigham