Hyperschema Theory for GP with One-Point Crossover, Building Blocks, and Some New Results in GA Theory

@inproceedings{Poli2000HyperschemaTF,
  title={Hyperschema Theory for GP with One-Point Crossover, Building Blocks, and Some New Results in GA Theory},
  author={Riccardo Poli},
  booktitle={EuroGP},
  year={2000}
}
Two main weaknesses of GA and GP schema theorems are that they provide only information on the expected value of the number of instances of a given schema at the next generation Em(H; t + 1)], and they can only give a lower bound for such a quantity. This paper presents new theoretical results on GP and GA schemata which largely overcome these weaknesses. Firstly, unlike previous results which concentrated on schema survival and disruption, our results extend to GP recent work on GA theory by… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 31 references

Analysis of complexity drift in genetic programming," in Genetic Programming

  • J. P. Rosca
  • Proceedings of the Second Annual Conference
  • 1997
Highly Influential
5 Excerpts

Probabilistic schema theorems without expectation, left-to-right con- vergence and population sizing in genetic algorithms,

  • R. Poli
  • Tech. Rep. CSRP-99-3,
  • 1999
3 Excerpts

Schema theorems without expectations," in GECCO-99: Proceedings of the Genetic and Evolutionary Computation

  • R. Poli
  • 1999
2 Excerpts

Genetic algorithms," in Handbook of Evolutionary Computation (T

  • G. Rudolph
  • eds.), pp. B2.4{20{27,
  • 1997
1 Excerpt

Modees of stochastic convergence," in Handbook of Evolutionary Computation (T

  • G. Rudolph
  • eds.), pp. B2.3{1{3,
  • 1997
1 Excerpt

Similar Papers

Loading similar papers…