Genetic Programming Bibliography entries for Jonathan Page
up to index
Created by W.Langdon from
William B Langdon,
Genetic Programming Articles by Jonathan Page
Genetic Programming PhD doctoral thesis Jonathan Page
Sub-Symbolic Representation and Search Operators for Genetic Programming. PhD thesis,
School of Computer Science, The University of Birmingham, B29 15TT, UK, 1999.
Genetic Programming conference papers by Jonathan Page
Riccardo Poli and Jonathan Page and W. B. Langdon.
Smooth Uniform Crossover, Sub-Machine Code GP and Demes: A Recipe For Solving High-Order Boolean Parity Problems. In
Wolfgang Banzhaf and Jason Daida and Agoston E. Eiben and Max H. Garzon and Vasant Honavar and Mark Jakiela and Robert E. Smith editors,
Proceedings of the Genetic and Evolutionary Computation Conference, volume 2, pages 1162-1169, Orlando, Florida, USA, 1999. Morgan Kaufmann.
J. Page and R. Poli and W. B. Langdon.
Smooth Uniform Crossover with Smooth Point Mutation in Genetic Programming: A Preliminary Study. In
Riccardo Poli and Peter Nordin and William B. Langdon and Terence C. Fogarty editors,
Genetic Programming, Proceedings of EuroGP'99, volume 1598, pages 39-49, Goteborg, Sweden, 1999. Springer-Verlag.
Genetic Programming technical reports by Jonathan Page
Riccardo Poli and Jonathan Page and William B. Langdon.
Solving Even-12, -13, -15, -17, -20 and -22 Boolean Parity Problems using Sub-machine Code GP with Smooth Uniform Crossover, Smooth Point Mutation and Demes. Technical report,
University of Birmingham, School of Computer Science, 1999.
Jonathan Page and Riccardo Poli and William B. Langdon.
Smooth Uniform Crossover with Smooth Point Mutation in Genetic Programming: A Preliminary Study. Technical report,
University of Birmingham, School of Computer Science, 1998.