Abstract: |
Grammatical Evolution is an automatic programming system, where a population of binary strings is evolved, from which phenotype strings are generated through a mapping process, that employs a grammar to define the syntax of such output strings. This paperspace into a smaller number of equivalence classes. This reduction allows easier computation of fixed points. The effect of model fixed points that are outside of the population space, but near enough to influence behavior of the Simple GA will be examined. This analysis will be applied to several fitness functions of unitation. |