Abstract: |
Evaluating GP schema in context is considered to be a complex,and, at times impossible, task. The tightly linkednodes of a GP tree is the main reason behind its complexity.This paper presents a new approach to evaluate GP schemain context. It is simple in its implementation with a potentialto address well-known GP problems, such as identicationof signicant schema, dead code (introns) and moduleacquisition to name a few.It is based on the principle that the contribution of aschema can be evaluated by neutralizing the eect of theschema in the tree containing it (container-tree) and thenchecking its eect on the container-tree's tness. Its usefulnessis empirically demonstrated along with its limitation. |
