<?xml version="1.0" encoding="UTF-8"?>

<rdf:RDF
   xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
   xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#"
   xmlns="http://purl.org/rss/1.0/"
   xmlns:dc="http://purl.org/dc/elements/1.1/"
   xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/"
   xmlns:dcterms="http://purl.org/dc/terms/"

>
<channel rdf:about="http://www.citeulike.org/about">
<pubDate>Thu, 21 Aug 2008 00:49:53 BST</pubDate>


	<title>CiteULike: mcphee's Schoenauer</title>
	<description>CiteULike: mcphee's Schoenauer</description>


	<link>http://www.citeulike.org/user/mcphee/author/Schoenauer</link>
	<dc:publisher>CiteULike.org</dc:publisher>
	<dc:language>en-gb</dc:language>
	<dc:rights>Copyright &#169; 2004-2008 citeulike.org</dc:rights>
	<items>
    <rdf:Seq>
        <rdf:li rdf:resource="http://www.citeulike.org/user/mcphee/article/2425916"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/mcphee/article/1730675"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/mcphee/article/125967"/>

	</rdf:Seq>
	</items>
	</channel>


<item rdf:about="http://www.citeulike.org/user/mcphee/article/2425916">
    <title>Blindbuilder: A New Encoding to Evolve Lego-Like Structures</title>
    <link>http://www.citeulike.org/user/mcphee/article/2425916</link>
    <description>&lt;i&gt;Genetic Programming (2006), pp. 61-72.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;This paper introduces a new representation for assemblies of small Lego -like elements: structures are indirectly encoded as construction plans. This representation shows some interesting properties such as hierarchy, modularity and easy constructibility checking by definition. Together with this representation, efficient GP operators are introduced that allow efficient and fast evolution, as witnessed by the results on two construction problems that demonstrate that the proposed approach is able to achieve both compactness and reusability of evolved components.</description>
    <dc:title>Blindbuilder: A New Encoding to Evolve Lego-Like Structures</dc:title>

    <dc:creator>Alexandre Devert</dc:creator>
    <dc:creator>Nicolas Bredeche</dc:creator>
    <dc:creator>Marc Schoenauer</dc:creator>
    <dc:identifier>doi:10.1007/11729976_6</dc:identifier>
    <dc:source>Genetic Programming (2006), pp. 61-72.</dc:source>
    <dc:date>2008-02-25T16:04:26-00:00</dc:date>
    <prism:publicationYear>2006</prism:publicationYear>
    <prism:publicationName>Genetic Programming</prism:publicationName>
    <prism:startingPage>61</prism:startingPage>
    <prism:endingPage>72</prism:endingPage>
    <prism:category>construction</prism:category>
    <prism:category>design</prism:category>
    <prism:category>development</prism:category>
    <prism:category>evolution</prism:category>
    <prism:category>evolutionary-computation</prism:category>
    <prism:category>lego</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/mcphee/article/1730675">
    <title>Fitness Causes Bloat: Mutation</title>
    <link>http://www.citeulike.org/user/mcphee/article/1730675</link>
    <description>&lt;i&gt;Vol. 1391 (JanuaryApril-JanuaryMay 1998), pp. 37-48.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;. The problem of evolving, using mutation, an artificial ant to follow the Santa Fe trail is used to study the well known genetic programming feature of growth in solution length. Known variously as &#34;bloat&#34;, &#34;fluff &#34; and increasing &#34;structural complexity&#34;, this is often described in terms of increasing &#34;redundancy&#34; in the code caused by &#34;introns&#34;. Comparison between runs with and without fitness selection pressure, backed by Price's Theorem, shows the tendency for solutions to grow in...</description>
    <dc:title>Fitness Causes Bloat: Mutation</dc:title>

    <dc:creator>WB Langdon</dc:creator>
    <dc:creator>R Poli</dc:creator>
    <dc:source>Vol. 1391 (JanuaryApril-JanuaryMay 1998), pp. 37-48.</dc:source>
    <dc:date>2007-10-05T11:06:33-00:00</dc:date>
    <prism:publicationYear>1998</prism:publicationYear>
    <prism:volume>1391</prism:volume>
    <prism:startingPage>37</prism:startingPage>
    <prism:endingPage>48</prism:endingPage>
    <prism:publisher>Springer-Verlag</prism:publisher>
    <prism:category>analysis</prism:category>
    <prism:category>bloat</prism:category>
    <prism:category>evolutionary-computation</prism:category>
    <prism:category>genetic-programming</prism:category>
    <prism:category>theory</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/mcphee/article/125967">
    <title>Hierarchically-Consistent Test Problems for Genetic Algorithms</title>
    <link>http://www.citeulike.org/user/mcphee/article/125967</link>
    <description>&lt;i&gt;(1999), pp. 1406-1413.&lt;/i&gt;</description>
    <dc:title>Hierarchically-Consistent Test Problems for Genetic Algorithms</dc:title>

    <dc:creator>Richard Watson</dc:creator>
    <dc:creator>Jordan Pollack</dc:creator>
    <dc:source>(1999), pp. 1406-1413.</dc:source>
    <dc:date>2005-03-13T07:13:20-00:00</dc:date>
    <prism:publicationYear>1999</prism:publicationYear>
    <prism:startingPage>1406</prism:startingPage>
    <prism:endingPage>1413</prism:endingPage>
    <prism:publisher>IEEE Press</prism:publisher>
    <prism:category>hiff-schema-gecco-05</prism:category>
</item>



</rdf:RDF>

