<?xml version="1.0" encoding="UTF-8" ?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
  <channel>
    <title>neat at Yahoo! Groups</title>
    <link>http://tech.groups.yahoo.com/group/neat/</link>
    <description>NEAT Users Group</description>

    <item>
      <title>Re: HyperNEAT Tutorial?</title>
      <pubDate>Mon, 09 Nov 2009 21:09:28 GMT</pubDate>
      <dc:creator>Ken</dc:creator>
      <link>http://tech.groups.yahoo.com/group/neat/message/4892</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/neat/message/4892</guid>
      <description>Yes I would advise starting out with NEAT to get familiar with it.  However, we can also look into improving the understandability of the HyperNEAT C&#43;&#43;</description>
    </item>
    <item>
      <title>Re: Odd speciation behaviour</title>
      <pubDate>Mon, 09 Nov 2009 20:15:30 GMT</pubDate>
      <dc:creator>rvonwahlde</dc:creator>
      <link>http://tech.groups.yahoo.com/group/neat/message/4891</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/neat/message/4891</guid>
      <description>Buckland&#39;s NEAT for windows code uses the Adjusted Fitness to calculate Span Amount.  Is this incorrect? In CSpecies::AdjustFitnesses(), for each member of a</description>
    </item>
    <item>
      <title>Re: Odd speciation behaviour</title>
      <pubDate>Mon, 09 Nov 2009 19:44:15 GMT</pubDate>
      <dc:creator>rvonwahlde</dc:creator>
      <link>http://tech.groups.yahoo.com/group/neat/message/4890</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/neat/message/4890</guid>
      <description>Buckland&#39;s NEAT for windows code uses the Adjusted Fitness to calculate Span Amount.  Is this incorrect? In CSpecies::AdjustFitnesses(), for each member of a</description>
    </item>
    <item>
      <title>Re: announcing new mailing list on Evolutionary Design of Robots</title>
      <pubDate>Mon, 09 Nov 2009 12:02:35 GMT</pubDate>
      <dc:creator>Ken Lloyd</dc:creator>
      <link>http://tech.groups.yahoo.com/group/neat/message/4889</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/neat/message/4889</guid>
      <description>Nicholas, Thanks for the notice.  Likewise, be aware of HART (Human, Agent, Robot, Teamwork). There is substantial research and application of evolutionary,</description>
    </item>
    <item>
      <title>announcing new mailing list on Evolutionary Design of Robots</title>
      <pubDate>Mon, 09 Nov 2009 08:25:48 GMT</pubDate>
      <dc:creator>Nicolas Bredeche</dc:creator>
      <link>http://tech.groups.yahoo.com/group/neat/message/4888</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/neat/message/4888</guid>
      <description>Dear all, Following the IROS workshop on Evolutionary Design of Robots held in october 2009, during IROS, we are starting a new mailing list regarding general</description>
    </item>
    <item>
      <title>Re: HyperNEAT Tutorial?</title>
      <pubDate>Mon, 09 Nov 2009 04:41:35 GMT</pubDate>
      <dc:creator>ramses_vi</dc:creator>
      <link>http://tech.groups.yahoo.com/group/neat/message/4887</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/neat/message/4887</guid>
      <description>Andrei, if you want to learn the underlying NEAT method by looking at c&#43;+ code, the best I have seen is Dr. Kenneth Stanley&#39;s rtNEAT c&#43;+ code. It is fairly</description>
    </item>
    <item>
      <title>Re: HyperNEAT Tutorial?</title>
      <pubDate>Sat, 07 Nov 2009 15:09:45 GMT</pubDate>
      <dc:creator>Andrei Rusu</dc:creator>
      <link>http://tech.groups.yahoo.com/group/neat/message/4886</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/neat/message/4886</guid>
      <description>I should have specified that I was talking exclusively  about the HyperNEAT 2.6 C&#43;+ implementation. I read some of the publications and the ideas are</description>
    </item>
    <item>
      <title>Re: HyperNEAT Tutorial?</title>
      <pubDate>Sat, 07 Nov 2009 14:49:12 GMT</pubDate>
      <dc:creator>Ken</dc:creator>
      <link>http://tech.groups.yahoo.com/group/neat/message/4885</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/neat/message/4885</guid>
      <description>Andrei, which version of HyperNEAT are you interested in and what references have you looked at so far?  We can potentially improve the documentation based on</description>
    </item>
    <item>
      <title>HyperNEAT Tutorial?</title>
      <pubDate>Sat, 07 Nov 2009 13:52:42 GMT</pubDate>
      <dc:creator>Andrei</dc:creator>
      <link>http://tech.groups.yahoo.com/group/neat/message/4884</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/neat/message/4884</guid>
      <description>Can anyone please recommend some HyperNEAT documentation, a tutorial, diagram, some clue, or anything that does not mean reverse engineering the comment-less</description>
    </item>
    <item>
      <title>Re: CPPNs. Recursive vs Feedforward</title>
      <pubDate>Wed, 04 Nov 2009 08:46:52 GMT</pubDate>
      <dc:creator>Colin Green</dc:creator>
      <link>http://tech.groups.yahoo.com/group/neat/message/4883</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/neat/message/4883</guid>
      <description>2009/11/4 jgmath2000 &lt;jgmath2000@...&gt; ... Noted. Thanks.</description>
    </item>
    <item>
      <title>Re: CPPNs. Recursive vs Feedforward</title>
      <pubDate>Wed, 04 Nov 2009 05:24:29 GMT</pubDate>
      <dc:creator>jgmath2000</dc:creator>
      <link>http://tech.groups.yahoo.com/group/neat/message/4882</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/neat/message/4882</guid>
      <description>Hey Colin, CPPNs, being an indirect encoding, allow for small changes in the genotype to have profound effects on the resulting substrate.  While this is what</description>
    </item>
    <item>
      <title>Re: CPPNs. Recursive vs Feedforward</title>
      <pubDate>Tue, 03 Nov 2009 23:23:28 GMT</pubDate>
      <dc:creator>Jean-Baptiste Mouret / Mandor</dc:creator>
      <link>http://tech.groups.yahoo.com/group/neat/message/4881</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/neat/message/4881</guid>
      <description>Hi Colin, ... Yes, this is exactly the second approach listed in the DAG part (i.e. &quot;Using shortest-path algorithms&quot;) since a feed-forward NN is obviously a</description>
    </item>
    <item>
      <title>Re: CPPNs. Recursive vs Feedforward</title>
      <pubDate>Tue, 03 Nov 2009 23:19:16 GMT</pubDate>
      <dc:creator>Colin Green</dc:creator>
      <link>http://tech.groups.yahoo.com/group/neat/message/4880</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/neat/message/4880</guid>
      <description>2009/11/3 Ken &lt;kstanley@...&gt; ... [...] Thanks. From reading your response my instinct is to use feedforward as the default/baseline for CPPNs and to</description>
    </item>
    <item>
      <title>Re: CPPNs. Recursive vs Feedforward</title>
      <pubDate>Tue, 03 Nov 2009 23:07:36 GMT</pubDate>
      <dc:creator>Colin Green</dc:creator>
      <link>http://tech.groups.yahoo.com/group/neat/message/4879</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/neat/message/4879</guid>
      <description>2009/11/3 Jean-Baptiste Mouret / Mandor &lt;mandor@...&gt; ... Thanks. I wonder if this is the same approach for DAGs listed here: </description>
    </item>
    <item>
      <title>Re: CPPNs. Recursive vs Feedforward (Efficient Feedforward)</title>
      <pubDate>Tue, 03 Nov 2009 22:41:38 GMT</pubDate>
      <dc:creator>Colin Green</dc:creator>
      <link>http://tech.groups.yahoo.com/group/neat/message/4878</link>
      <guid isPermaLink="true">http://tech.groups.yahoo.com/group/neat/message/4878</guid>
      <description>2009/11/3 Ken &lt;kstanley@...&gt; ... [...] ... Yes I see. It&#39;s like evaluating an expression tree but with an extra rule for handling the fact it&#39;s not a</description>
    </item>

  </channel>
</rss>
<!-- wr2.grp.sp2.yahoo.com uncompressed/chunked Thu Dec  3 12:01:19 PST 2009 -->
