Evolving Controllers for Simulated Car Racing using Object Oriented Genetic Programming (Page 1543)
A. Agapitos (University of Essex)
J. Togelius (University of Essex)
S. M. Lucas (University of Essex)

The Roles of Diversity Preservation and Mutation in Preventing Population Collapse in Multiobjective Genetic Programming (Page 1551)
K. M. S. Badran (University of Sheffield)
P. I. Rockett (University of Sheffield)

Automatic Heuristic Generation with Genetic Programming: Evolving a Jack-of-all Trades or a Master of One (Page 1559)
E. K. Burke (The University of Nottingham)
M. Hyde (The University of Nottingham)
G. Kendall (The University of Nottingham)
J. Woodward (The University of Nottingham)

A Data Parallel Approach to Genetic Programming Using Programmable Graphics Hardware (Page 1566)
D. M. Chitty (QinetiQ Malvern)

Solving the Artificial Ant on the Santa Fe Trail Problem in 20,696 Fitness Evaluations (Page 1574)
S. Christensen (Carleton University)
F. Oppacher (Carleton University)

A New Crossover Technique for Cartesian Genetic Programming: Genetic Programming Track (Page 1580)
J. Clegg (University of York)
J. A. Walker (University of York)
J. F. Miller (University of York)

Generalisation of the Limiting Distributioin of Program Sizes in Tree-based Genetic Programming and Analysis of its Effects on Bloat (Page 1588)
S. Dignum (University of Essex)
R. Poli (University of Essex)

Mixing Independent Classifiers (Page 1596)
J. Drugowitsch (University of Bath)
A. M. Barry (University of Bath)

Evolving Lucene Search Queries for Text Classification (Page 1604)
L. Hirsch (Sheffield Hallam University)
R. Hirsch (University College London)
M. Saeedi (Royal Holloway University)

Hierarchical Genetic Programming Based on Test Input Subsets (Page 1612)
D. Jackson (University of Liverpool)

Genetic Programming for Cross-Task Knowledge Sharing (Page 1620)
W. Jaśkowski (Poznan University of Technology)
K. Krawiec (Poznan University of Technology)
B. Wieloch (Poznan University of Technology)

Unwitting Distributed Genetic Programming via Asynchronous JavaScript and XML (Page 1628)
J. Klein (Hampshire College, Chalmers University and Goteborg University)
L. Spector (Hampshire College)

On the Behavioral Diversity of Random Programs (Page 1636)
M. Looks (Washington University in St. Louis)

The Genetic Programming Collaboration Network and Its Communities (Page 1643)
L. Luthi (University of Lausanne)
M. Tomassini (University of Lausanne)
M. Giacobini (University of Torino)
W. B. Langdon (University of Essex)

Context-Aware Mutation: A Modular, Context Aware Mutation Operator for Genetic Programming (Page 1651)
H. Majeed (University of Limerick)
C. Ryan (University of Limerick)

On the Constructiveness of Context-Aware Crossover (Page 1659)
H. Majeed (University of Limerick)
C. Ryan (University of Limerick)

Best SubTree Genetic Programming (Page 1667)
O. Muntean (Babes-Bolyai University)
L. Diosan (Babes-Bolyai University)
M. Oltean (Babes-Bolyai University)

Comparison of Tree and Graph Encodings as Function of Problem Complexity (Page 1674)
M. Schmidt (Cornell University)
H. Lipson (Cornell University)

Learning Noise (Page 1680)
M. Schmidt (Cornell University)
H. Lipson (Cornell University)

Graph Structured Program Evolution (Page 1686)
S. Shirakawa (Yokohama National University)
S. Ogino (Yokohama National University)
T. Nagao (Yokohama National University)

Improving the Human Readability of Features Constructed by Genetic Programming (Page 1694)
M. Smith (University of the West of England)
L. Bull (University of the West of England)

Evolving Kernels for Support Vector Machine Classification (Page 1702)
K. Sullivan (George Mason University)
S. Luke (George Mason University)

Novel Ways of Improving Cooperation and Performance in Ensemble Classifiers (Page 1708)
R. Thomason (University of Idaho)
T. Soule (University of Idaho)

The Reliability of Confidence Intervals for Computational Effort Comparisons (Page 1716)
M. Walker (Massey University)
H. Edwards (Massey University)
C. Messom (Massey University)

Solving Real-valued Optimisation Problems using Cartesian Genetic Programming: Genetic Programming Track (Page 1724)
J. A. Walker (University of York)
J. F. Miller (University of York)

Genetic Evolution of Hierarchical Behavior Structures (Page 1731)
B. G. Woolley (Air Force Institute of Technology)
G. L. Peterson (Air Force Institute of Technology)

An Analysis of Constructive Crossover and Selection Pressure in Genetic Programming (Page 1739)
H. Xie (Victoria University of Wellington)
M. Zhang (Victoria University of Wellington)
P. Andreae (Victoria University of Wellington)

Genetic Programming: Posters

A GP-Based Hyper-Heuristic Framework for Evolving 3-SAT Heuristics (Page 1749)
M. Bader-El-Den (University of Essex)
R. Poli (University of Essex)

Discovering Structures in Gene Regulatory Networks Using Genetic Programming and Particle Swarms (Page 1750)
X. Cai (Kansas State University)
S. M. Welch (Kansas State University)
P. Koduru (Kansas State University)
S. Das (Kansas State University)

StreamGP: Tracking Evolving GP Ensembles in Distributed Data Streams using Fractal Dimension (Page 1751)
G. Folino (ICAR-CNR)
C. Pizzuti (ICAR-CNR)
G. Spezzano (ICAR-CNR)

Dynamic Populations and Length Evolution: Key Factors for Analyzing Fault Tolerance on Parallel Genetic Programming (Page 1752)
D. L. González (University of Extremadura)
F. F. de Vega (University of Extremadura)

Linear Genetic Programming of Metaheuristics (Page 1753)
R. E. Keller (University of Essex)
R. Poli (University of Essex)

Program Search with Simulated Annealing (Page 1754)
M. Miki (Doshisha University)
M. Hashimoto (Doshisha University)
Y. Fujita (Doshisha University)

Seeding Methods for Run Transferable Libraries (Page 1755)
G. Murphy (University of Limerick)
C. Ryan (University of Limerick)

Genetic Programming Approach for Positron Collisions with Alkali-metal Atom (Page 1756)
A. Radi (Ain Shams University)
S. Y. El-Bakry (Taibah University)

Towards an Optimal Restart Strategy for Genetic Programming (Page 1757)
M. Solano (Oklahoma State University)
I. Jonyer (Oklahoma State University)

Association Rule Mining for Continuous Attributes using Genetic Network Programming (Page 1758)
K. Taboada (Waseda University)
K. Shimada (Waseda University)
S. Mabu (Waseda University)
K. Hirasawa (Waseda University)
J. Hu (Waseda University)

Multi-Optimization Improves Genetic Programming Generalization Ability (Page 1759)
L. Vanneschi (University of Milano-Bicocca)
D. Rochat (University of Lausanne)
M. Tomassini (University of Lausanne)

"Success Effort" for Performance Comparisons (Page 1760)
M. Walker (Massey University)
H. Edwards (Massey University)
C. Messom (Massey University)

Numerical-Node Building Block Analysis of Genetic Programming with Simplification (Page 1761)
P. Wong (Victoria University of Wellington)
M. Zhang (Victoria University of Wellington)

Adaptive Strategies for a Semantically Driven Tree Optimizer to Control Code Growth (Page 1762)
B. Wyns (Ghent University)
L. Boullart (Ghent University)

Limiting Code Growth to Improve Robustness in Tree-based Genetic Programming (Page 1763)
B. Wyns (Ghent University)
L. Boullart (Ghent University)
P. J. De Smedt (Ghent University)