Download Report

Here is how to use “gpbook.bst”
Riccardo Poli
May 28, 2012
Please see the source code for this test document.
This is a test document citing the following papers:(Poli, 1999a,b,c,d,e,f,
2000a,b,c,d,e,f; Poli and Langdon, 1997a,b,c,d,e,f,g, 1998a,b; Poli, Langdon, and
O’Reilly, 1998a,b; Poli and McPhee, 2000a,b)
References
R. Poli. Schema theorems without expectations. In W. Banzhaf, et al.,
editors, Proceedings of the Genetic and Evolutionary Computation Conference, volume 1, page 806, Orlando, Florida, USA, 13-17 July 1999a. Morgan
Kaufmann. ISBN 1-55860-611-4. URL http://www.cs.bham.ac.uk/~wbl/
biblio/gecco1999/Poli-GECCO1999-Poster.pdf.
R. Poli. Probabilistic schema theorems without expectation, left-to-right convergence and population sizing in genetic algorithms. Technical Report CSRP99-3, University of Birmingham, School of Computer Science, January 1999b.
R. Poli. Probabilistic schema theorems without expectation, recursive conditional schema theorem, convergence and population sizing in genetic algorithms. Technical Report CSRP-99-3, University of Birmingham, School of
Computer Science, January 1999c. URL ftp://ftp.cs.bham.ac.uk/pub/
tech-reports/1999/CSRP-99-03.ps.gz.
R. Poli. Schema theory without expectations for GP and GAs with one-point
crossover in the presence of schema creation. Technical Report CSRP-99-13,
University of Birmingham, School of Computer Science, May 1999d. URL
ftp://ftp.cs.bham.ac.uk/pub/tech-reports/1999/CSRP-99-13.ps.gz.
R. Poli. Schema theory without expectations for GP and GAs with one-point
crossover in the presence of schema creation. In T. Haynes, et al., editors,
Foundations of Genetic Programming, pages 61–63, Orlando, Florida, USA,
13 July 1999e. URL http://www.cs.essex.ac.uk/staff/poli/papers/
poliFOGPwkshp1999.pdf.
1
R. Poli. New results in the schema theory for GP with one-point crossover
which account for schema creation, survival and disruption. Technical Report
CSRP-99-18, University of Birmingham, School of Computer Science, December 1999f. URL ftp://ftp.cs.bham.ac.uk/pub/tech-reports/1999/
CSRP-99-18.ps.gz.
R. Poli. On fitness proportionate selection and the schema theorem in the
presence of stochastic effects. Technical Report CSRP-00-2, University of
Birmingham, School of Computer Science, February 2000a. URL ftp://
ftp.cs.bham.ac.uk/pub/tech-reports/2000/CSRP-00-02.ps.gz.
R. Poli. A macroscopic exact schema theorem and a redefinition of effective
fitness for GP with one-point crossover. Technical Report CSRP-00-1, University of Birmingham, School of Computer Science, February 2000b. URL
ftp://ftp.cs.bham.ac.uk/pub/tech-reports/2000/CSRP-00-01.ps.gz.
R. Poli. Hyperschema theory for GP with one-point crossover, building blocks,
and some new results in GA theory. In R. Poli, et al., editors, Genetic Programming, Proceedings of EuroGP’2000, volume 1802 of LNCS, pages 163–
180, Edinburgh, 15-16 April 2000c. Springer-Verlag. ISBN 3-540-67339-3.
URL http://www.springerlink.com/openurl.asp?genre=article&issn=
0302-9743&volume=1802&spage=163.
R. Poli. Exact schema theorem and effective fitness for GP with one-point
crossover. In L. D. Whitley, et al., editors, Proceedings of the Genetic and
Evolutionary Computation Conference (GECCO-2000), pages 469–476, Las
Vegas, Nevada, USA, 10-12 July 2000d. Morgan Kaufmann. ISBN 1-55860708-0. URL http://www.cs.bham.ac.uk/~wbl/biblio/gecco2000/GP227.
pdf.
R. Poli. Microscopic and macroscopic schema theories for genetic programming and variable-length genetic algorithms with one-point crossover, their
use and their relations with earlier GP and GA schema theories. Technical
Report CSRP-00-15, University of Birmingham, School of Computer Science,
October 2000e. URL ftp://ftp.cs.bham.ac.uk/pub/tech-reports/2000/
CSRP-00-15.ps.gz.
R. Poli. General schema theory for genetic programming with subtree-swapping
crossover. Technical Report CSRP-00-16, University of Birmingham, School
of Computer Science, November 2000f. URL ftp://ftp.cs.bham.ac.uk/
pub/tech-reports/2000/CSRP-00-16.ps.gz.
R. Poli and W. B. Langdon. A new schema theory for genetic programming
with one-point crossover and point mutation. Technical Report CSRP-97-3,
School of Computer Science, The University of Birmingham, B15 2TT, UK,
January 1997a. URL ftp://ftp.cs.bham.ac.uk/pub/tech-reports/1997/
CSRP-97-03.ps.gz. Presented at GP-97.
2
R. Poli and W. B. Langdon. An experimental analysis of schema creation,
propagation and disruption in genetic programming. Technical Report
CSRP-97-8, University of Birmingham, School of Computer Science, February 1997b.
URL ftp://ftp.cs.bham.ac.uk/pub/tech-reports/1997/
CSRP-97-08.ps.gz. Presented at ICGA-97.
R. Poli and W. B. Langdon. Genetic programming with one-point crossover.
In P. K. Chawdhry, et al., editors, Soft Computing in Engineering Design and Manufacturing, pages 180–189. Springer-Verlag London, 23-27 June
1997c. ISBN 3-540-76214-0. URL http://cswww.essex.ac.uk/staff/poli/
papers/Poli-WSC2-1997.pdf.
R. Poli and W. B. Langdon. A new schema theory for genetic programming
with one-point crossover and point mutation. In J. R. Koza, et al., editors,
Genetic Programming 1997: Proceedings of the Second Annual Conference,
pages 278–285, Stanford University, CA, USA, 13-16 July 1997d. Morgan
Kaufmann. URL http://citeseer.ist.psu.edu/327495.html.
R. Poli and W. B. Langdon. An experimental analysis of schema creation,
propagation and disruption in genetic programming. In T. Back, editor, Genetic Algorithms: Proceedings of the Seventh International Conference, pages
18–25, Michigan State University, East Lansing, MI, USA, 19-23 July 1997e.
Morgan Kaufmann. ISBN 1-55860-487-1. URL http://cswww.essex.ac.uk/
staff/rpoli/papers/Poli-ICGA1997.pdf.
R. Poli and W. B. Langdon. A review of theoretical and experimental results on
schemata in genetic programming. Technical Report CSRP-97-27, University
of Birmingham, B15 2TT, UK, November 1997f. URL ftp://ftp.cs.bham.
ac.uk/pub/tech-reports/1997/CSRP-97-27.ps.gz. Presented at ET-97.
R. Poli and W. B. Langdon. A review of theoretical and experimental results on
schemata in genetic programming. In C. Clack, et al., editors, ET’97 Theory
and Application of Evolutionary Computation, pages 29–43, University College London, UK, 15 December 1997g. URL http://www.cs.essex.ac.uk/
staff/poli/papers/Poli-EUROGP1998.pdf.
R. Poli and W. B. Langdon. A review of theoretical and experimental results on schemata in genetic programming. In W. Banzhaf, et al., editors, Proceedings of the First European Workshop on Genetic Programming, volume 1391 of LNCS, pages 1–15, Paris, 14-15 April 1998a. SpringerVerlag. ISBN 3-540-64360-5. URL http://cswww.essex.ac.uk/staff/
rpoli/papers/Poli-EUROGP1998.pdf.
R. Poli and W. B. Langdon. Schema theory for genetic programming with
one-point crossover and point mutation. Evolutionary Computation, 6(3):
231–252, 1998b. URL http://cswww.essex.ac.uk/staff/poli/papers/
Poli-ECJ1998.pdf.
3
R. Poli, W. B. Langdon, and U.-M. O’Reilly. Short term extinction probability of newly created schemata, and schema variance and signal-tonoise-ratio theorems in the presence of schema creation. Technical Report CSRP-98-6, University of Birmingham, School of Computer Science,
January 1998a. URL ftp://ftp.cs.bham.ac.uk/pub/tech-reports/1998/
CSRP-98-06.ps.gz. Presented at GP-98.
R. Poli, W. B. Langdon, and U.-M. O’Reilly. Analysis of schema variance and
short term extinction likelihoods. In J. R. Koza, et al., editors, Genetic
Programming 1998: Proceedings of the Third Annual Conference, pages 284–
292, University of Wisconsin, Madison, Wisconsin, USA, 22-25 July 1998b.
Morgan Kaufmann. ISBN 1-55860-548-7. URL http://cswww.essex.ac.uk/
staff/poli/papers/Poli-GP1998-Schema.pdf.
R. Poli and N. F. McPhee. Exact schema theorems for GP with one-point and
standard crossover operating on linear structures and their application to
the study of the evolution of size. Technical Report CSRP-00-14, University
of Birmingham, School of Computer Science, October 2000a. URL ftp:
//ftp.cs.bham.ac.uk/pub/tech-reports/2000/CSRP-00-14.ps.gz.
R. Poli and N. F. McPhee. Exact GP schema theory for headless chicken
crossover and subtree mutation. Technical Report CSRP-00-23, University of Birmingham, School of Computer Science, December 2000b. URL
ftp://ftp.cs.bham.ac.uk/pub/tech-reports/2000/CSRP-00-23.ps.gz.
4