<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"><channel><title>Netvouz / laughingboy / tag / algorithm</title>
<link>http://netvouz.com/laughingboy/tag/algorithm?feed=rss</link>
<description>laughingboy&#39;s bookmarks tagged &quot;algorithm&quot; on Netvouz</description>
<item><title>10 Papers Every Programmer Should Read (At Least Twice)</title>
<link>http://blog.objectmentor.com/articles/2009/02/26/10-papers-every-programmer-should-read-at-least-twice</link>
<description></description>
<category domain="http://netvouz.com/laughingboy?category=1952908036249151662"></category>
<author>laughingboy</author>
<pubDate>Sun, 07 Jun 2009 14:37:37 GMT</pubDate>
</item><item><title>A Field Guide to Genetic Programming by Riccardo Poli, William B Langdon, Nicholas Freitag McPhee (Book) in Computers &amp; Interne</title>
<link>http://www.lulu.com/product/download/a-field-guide-to-genetic-programming/2502914</link>
<description>good genetic programming ebook</description>
<category domain="http://netvouz.com/laughingboy?category=1952908036249151662"></category>
<author>laughingboy</author>
<pubDate>Tue, 08 Apr 2008 06:30:06 GMT</pubDate>
</item><item><title>A Resettable Memoize in Clojure</title>
<link>http://www.paullegato.com/blog/memoize-reset-clojure/</link>
<description>Paul Legato</description>
<category domain="http://netvouz.com/laughingboy?category=1952908036249151662"></category>
<author>laughingboy</author>
<pubDate>Sun, 28 Feb 2010 04:36:16 GMT</pubDate>
</item><item><title>Aho/Ullman Foundations of Computer Science</title>
<link>http://infolab.stanford.edu/~ullman/focs.html</link>
<description></description>
<category domain="http://netvouz.com/laughingboy?category=1952908036249151662"></category>
<author>laughingboy</author>
<pubDate>Sun, 19 Oct 2008 19:45:42 GMT</pubDate>
</item><item><title>Algorithm Blogs » Blog Archive » Understanding the Nyquist Limit</title>
<link>http://www.algorithm.co.il/blogs/index.php/math/understanding-the-nyquist-limit/</link>
<description></description>
<category domain="http://netvouz.com/laughingboy?category=1952908036249151662"></category>
<author>laughingboy</author>
<pubDate>Mon, 01 Dec 2008 04:22:23 GMT</pubDate>
</item><item><title>Algorithm Education in Python</title>
<link>http://www.ece.uci.edu/~chou/py02/python.html</link>
<description></description>
<category domain="http://netvouz.com/laughingboy?category=1952908036249151662"></category>
<author>laughingboy</author>
<pubDate>Mon, 19 Mar 2007 20:35:32 GMT</pubDate>
</item><item><title>Algorithms and Data Structures</title>
<link>http://www.csse.monash.edu.au/~lloyd/tildeAlgDS/</link>
<description>reference</description>
<category domain="http://netvouz.com/laughingboy?category=1952908036249151662"></category>
<author>laughingboy</author>
<pubDate>Mon, 25 Aug 2008 04:54:25 GMT</pubDate>
</item><item><title>All About Monads</title>
<link>http://web.archive.org/web/20070119155218/http://www.nomaware.com/monads/html/index.html</link>
<description>A comprehensive guide to the theory and practice of monadic programming in Haskell</description>
<category domain="http://netvouz.com/laughingboy?category=1952908036249151662"></category>
<author>laughingboy</author>
<pubDate>Wed, 10 Dec 2008 14:58:12 GMT</pubDate>
</item><item><title>Artificial Intelligence | Machine Learning</title>
<link>http://see.stanford.edu/see/courseinfo.aspx?coll=348ca38a-3a6d-4052-937d-cb017338d7b1</link>
<description>free online course lectures, etc for Stanford Engineering course in Machine Learning</description>
<category domain="http://netvouz.com/laughingboy?category=1952908036249151662"></category>
<author>laughingboy</author>
<pubDate>Mon, 20 Apr 2009 00:03:25 GMT</pubDate>
</item><item><title>ASPN : Python Cookbook : Yet Another Unique() Function</title>
<link>http://aspn.activestate.com/ASPN/Cookbook/Python/Recipe/502263</link>
<description></description>
<category domain="http://netvouz.com/laughingboy?category=1952908036249151662"></category>
<author>laughingboy</author>
<pubDate>Wed, 07 Mar 2007 22:36:32 GMT</pubDate>
</item></channel></rss>