<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><channel rdf:about="https://www.bibsonomy.org/user/a_olympia/algorithms"><title>BibSonomy bookmarks for /user/a_olympia/algorithms</title><link>https://www.bibsonomy.org/user/a_olympia/algorithms</link><description>BibSonomy RSS Feed for /user/a_olympia/algorithms</description><items><rdf:Seq><rdf:li rdf:resource="http://anand.typepad.com/datawocky/2008/03/more-data-usual.html"/><rdf:li rdf:resource="http://www.random.org/"/><rdf:li rdf:resource="http://mathworld.wolfram.com/TravelingSalesmanProblem.html"/></rdf:Seq></items></channel><item rdf:about="http://anand.typepad.com/datawocky/2008/03/more-data-usual.html"><title>Datawocky: More data usually beats better algorithms</title><description></description><link>http://anand.typepad.com/datawocky/2008/03/more-data-usual.html</link><dc:creator>a_olympia</dc:creator><dc:date>2008-04-02T17:40:52+02:00</dc:date><dc:subject>advertising advice algorithm algorithms apps blog code computers data datamining development netflix optimization programming </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2008-04-02T17:40:52+02:00&#034; href=&#034;http://anand.typepad.com/datawocky/2008/03/more-data-usual.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://anand.typepad.com/datawocky/2008/03/more-data-usual.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/advertising"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/advice"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithm"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/apps"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/blog"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/code"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/computers"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/data"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/datamining"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/development"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/netflix"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/optimization"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/programming"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.random.org/"><title>RANDOM.ORG - True Random Number Service</title><description></description><link>http://www.random.org/</link><dc:creator>a_olympia</dc:creator><dc:date>2008-03-13T14:47:21+01:00</dc:date><dc:subject>algorithm algorithms alpha apps archive bookmarks books code generator math number numbers programming random science tools </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2008-03-13T14:47:21+01:00&#034; href=&#034;http://www.random.org/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.random.org/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithm"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/alpha"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/apps"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/archive"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/bookmarks"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/books"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/code"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/generator"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/math"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/number"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/numbers"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/programming"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/random"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/science"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/tools"/></rdf:Bag></taxo:topics></item><item rdf:about="http://mathworld.wolfram.com/TravelingSalesmanProblem.html"><title>Traveling Salesman Problem -- from Wolfram MathWorld</title><description></description><link>http://mathworld.wolfram.com/TravelingSalesmanProblem.html</link><dc:creator>a_olympia</dc:creator><dc:date>2007-09-11T09:15:42+02:00</dc:date><dc:subject>Problem Salesman Traveling algorithms optimization </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2007-09-11T09:15:42+02:00&#034; href=&#034;http://mathworld.wolfram.com/TravelingSalesmanProblem.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://mathworld.wolfram.com/TravelingSalesmanProblem.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Problem"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Salesman"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Traveling"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/optimization"/></rdf:Bag></taxo:topics></item></rdf:RDF>