 
  
  
  
  
 Next: Genetic Programming
Up: Genetic Algorithms
 Previous: Schema Theorem
 
-  whether an individual representing schema   at time at time will
be selected for time will
be selected for time , or still represent , or still represent after crossover,
or still represent after crossover,
or still represent after mutation after mutation
-  effects of crossover increase with the number of defined bits
-  effects of mutation increase with the distance between defined
bits
-  more fit schemas will grow in influence, especially schemas with
a small number of defined bits and especially when these defined bits
are near each other in the bit string
-  incomplete because it fails to take into account the positive
effects of crossover and mutation (i.e., only gives lower bound) -
numerous more recent theoretical analyses
 
Patricia Riddle 
Fri May 15 13:00:36 NZST 1998