<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>02040705</id>
  <dt>a</dt>
  <an>02040705</an>
  <augroup>
    <au>Daida, Jason M.</au>
    <au>Hilss, Adam M.</au>
  </augroup>
  <ti>Identifying structural mechanisms in standard genetic programming.</ti>
  <so>Cant\'u-Paz, Erick (ed.) et al., Genetic and evolutionary computation -- GECCO 2003. Genetic and evolutionary computation conference, Chicago, IL, USA, July 12--16, 2003. Proceedings, Part II. Berlin: Springer (ISBN 3-540-40603-4/pbk). Lect. Notes Comput. Sci. 2724, 1639-1651 (2003).</so>
  <py>2003</py>
  <pu>Berlin: Springer</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>http://link.springer.de/link/service/series/0558/bibs/2724/27241639.htm</li>
  </ligroup>
  <abgroup>
    <ab>Summary: This paper presents a hypothesis about an undiscovered class of mechanisms that exist in standard GP. Rather than being intentionally designed, these mechanisms would be an unintended consequence of using trees as information structures. A model is described that predicts outcomes in GP that would arise solely from such mechanisms. Comparisons with empirical results from GP lend support to the existence of these mechanisms.</ab>
    <rv></rv>
  </abgroup>
</item>