<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>bodom_lx at task3 dot cc &#187; algorithms</title>
	<atom:link href="http://task3.cc/tag/algorithms/feed/" rel="self" type="application/rss+xml" />
	<link>http://task3.cc</link>
	<description>Trying to be mathematically simple and precise</description>
	<lastBuildDate>Mon, 30 Aug 2010 12:32:29 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0.1</generator>
		<item>
		<title>Pomodroid v0.7.0, now with direct task input!</title>
		<link>http://task3.cc/1773/pomodroid-v0-7-0-now-with-direct-task-input/</link>
		<comments>http://task3.cc/1773/pomodroid-v0-7-0-now-with-direct-task-input/#comments</comments>
		<pubDate>Sun, 18 Jul 2010 22:29:19 +0000</pubDate>
		<dc:creator>bodom_lx</dc:creator>
				<category><![CDATA[Free*]]></category>
		<category><![CDATA[algorithms]]></category>
		<category><![CDATA[android pomodoro]]></category>
		<category><![CDATA[pomodoro manager android]]></category>
		<category><![CDATA[pomodoro technique]]></category>
		<category><![CDATA[pomodroid]]></category>

		<guid isPermaLink="false">http://task3.cc/?p=1773</guid>
		<description><![CDATA[It&#8217;s a pleasure for me to announce the availability of Pomodroid v0.7.0 in the Android Market. For this release I finally implemented the possibility for a user to define his/her own tasks, thus manually input them. This was heavily requested as a feature, now it is a reality. Here is a proof Pomodroid v0.7.0 also [...]]]></description>
		<wfw:commentRss>http://task3.cc/1773/pomodroid-v0-7-0-now-with-direct-task-input/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>On the geolocation based driver-rider matching algorithm of Dycapo</title>
		<link>http://task3.cc/1719/on-the-geolocation-based-driver-rider-matching-algorithm-of-dycapo/</link>
		<comments>http://task3.cc/1719/on-the-geolocation-based-driver-rider-matching-algorithm-of-dycapo/#comments</comments>
		<pubDate>Wed, 12 May 2010 14:14:55 +0000</pubDate>
		<dc:creator>bodom_lx</dc:creator>
				<category><![CDATA[Carpooling Research]]></category>
		<category><![CDATA[Programming]]></category>
		<category><![CDATA[agile carpooling]]></category>
		<category><![CDATA[agile carsharing]]></category>
		<category><![CDATA[algorithms]]></category>
		<category><![CDATA[databases]]></category>
		<category><![CDATA[django]]></category>
		<category><![CDATA[dns]]></category>
		<category><![CDATA[DyCaPo]]></category>
		<category><![CDATA[dynamic carpooling]]></category>
		<category><![CDATA[FBK]]></category>
		<category><![CDATA[geolocation]]></category>
		<category><![CDATA[python]]></category>
		<category><![CDATA[SoNet]]></category>

		<guid isPermaLink="false">http://task3.cc/?p=1719</guid>
		<description><![CDATA[UPDATED 2010-22-05: I enhanced the first part of the algorithm. It does not longer use a delta computed empirically by looking at maps. Now it dynamically creates a box around the destination using a user given offset. Starting from Dycapo Server v0.3.0 we introduced a new searching algorithm for riders. This algorithm is still in [...]]]></description>
		<wfw:commentRss>http://task3.cc/1719/on-the-geolocation-based-driver-rider-matching-algorithm-of-dycapo/feed/</wfw:commentRss>
		<slash:comments>4</slash:comments>
		</item>
		<item>
		<title>Announcing Dycapo Server v0.3.0 &#8211; this one is serious</title>
		<link>http://task3.cc/1713/announcing-dycapo-server-v0-3-0-this-one-is-serious/</link>
		<comments>http://task3.cc/1713/announcing-dycapo-server-v0-3-0-this-one-is-serious/#comments</comments>
		<pubDate>Wed, 12 May 2010 11:31:47 +0000</pubDate>
		<dc:creator>bodom_lx</dc:creator>
				<category><![CDATA[Carpooling Research]]></category>
		<category><![CDATA[agile ridesharing]]></category>
		<category><![CDATA[algorithms]]></category>
		<category><![CDATA[django]]></category>
		<category><![CDATA[DyCaPo]]></category>
		<category><![CDATA[dycapo server]]></category>
		<category><![CDATA[dynamic carpooling]]></category>
		<category><![CDATA[dynamic ridesharing]]></category>
		<category><![CDATA[FBK]]></category>
		<category><![CDATA[opensource]]></category>
		<category><![CDATA[python]]></category>
		<category><![CDATA[SoNet]]></category>

		<guid isPermaLink="false">http://task3.cc/?p=1713</guid>
		<description><![CDATA[It&#8217;s a pleasure for me to announce the release v0.3.0 of Dycapo Server. This release brings in a lot of enhancements, bugs fixed and features. The greater one are the introduction of a real testing suite using py.test and a real driver-riders geolocated matching algorithm. I will also write an article regarding the algorithm today. [...]]]></description>
		<wfw:commentRss>http://task3.cc/1713/announcing-dycapo-server-v0-3-0-this-one-is-serious/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Wiki set up, first meeting</title>
		<link>http://task3.cc/1401/wiki-set-up-first-meeting/</link>
		<comments>http://task3.cc/1401/wiki-set-up-first-meeting/#comments</comments>
		<pubDate>Wed, 14 Oct 2009 14:46:16 +0000</pubDate>
		<dc:creator>bodom_lx</dc:creator>
				<category><![CDATA[Carpooling Research]]></category>
		<category><![CDATA[algorithms]]></category>
		<category><![CDATA[api]]></category>
		<category><![CDATA[Design]]></category>
		<category><![CDATA[dynamic]]></category>
		<category><![CDATA[dynamic carpooling]]></category>
		<category><![CDATA[FBK]]></category>
		<category><![CDATA[paper]]></category>
		<category><![CDATA[promise]]></category>
		<category><![CDATA[research]]></category>
		<category><![CDATA[set]]></category>

		<guid isPermaLink="false">http://task3.cc/?p=1401</guid>
		<description><![CDATA[Both the Wiki and the blog has been set up. Tomorrow I&#8217;m going to have the first official meeting at FBK to discuss my first results. I&#8217;ve just finished the grid containing a short description that each paper proposed as a solution (or suggest) for the areas: System Suggestions Interface Design Algorithms Coordination Trustiness Safety/Reputation [...]]]></description>
		<wfw:commentRss>http://task3.cc/1401/wiki-set-up-first-meeting/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Hash Maps with linear probing and separate chaining</title>
		<link>http://task3.cc/308/hash-maps-with-linear-probing-and-separate-chaining/</link>
		<comments>http://task3.cc/308/hash-maps-with-linear-probing-and-separate-chaining/#comments</comments>
		<pubDate>Mon, 28 Apr 2008 09:55:20 +0000</pubDate>
		<dc:creator>bodom_lx</dc:creator>
				<category><![CDATA[Programming]]></category>
		<category><![CDATA[algorithms]]></category>
		<category><![CDATA[C language]]></category>
		<category><![CDATA[code]]></category>
		<category><![CDATA[data structures]]></category>
		<category><![CDATA[Download]]></category>
		<category><![CDATA[hash]]></category>
		<category><![CDATA[hash map]]></category>
		<category><![CDATA[hash table]]></category>
		<category><![CDATA[java]]></category>
		<category><![CDATA[javascript]]></category>
		<category><![CDATA[link]]></category>
		<category><![CDATA[list]]></category>
		<category><![CDATA[pageTracker]]></category>
		<category><![CDATA[rest]]></category>
		<category><![CDATA[source]]></category>
		<category><![CDATA[wikipedia]]></category>

		<guid isPermaLink="false">http://task3.cc/?p=308</guid>
		<description><![CDATA[Time for two new C programs! At the DSA course I learned something about Hash Tables and collision resolutions. I just implemented insert/search/print operations. The first source code is an implementation of a Hash Map with open addressing (linear probing) as collision resolution method. The following are the interesting functions of the program. As always, [...]]]></description>
		<wfw:commentRss>http://task3.cc/308/hash-maps-with-linear-probing-and-separate-chaining/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>A Generic Quicksort Implementation in C</title>
		<link>http://task3.cc/295/a-generic-quicksort-implementation-in-c/</link>
		<comments>http://task3.cc/295/a-generic-quicksort-implementation-in-c/#comments</comments>
		<pubDate>Mon, 07 Apr 2008 09:58:42 +0000</pubDate>
		<dc:creator>bodom_lx</dc:creator>
				<category><![CDATA[Programming]]></category>
		<category><![CDATA[algorithms]]></category>
		<category><![CDATA[C language]]></category>
		<category><![CDATA[code]]></category>
		<category><![CDATA[data structures]]></category>
		<category><![CDATA[Design]]></category>
		<category><![CDATA[Download]]></category>
		<category><![CDATA[java]]></category>
		<category><![CDATA[javascript]]></category>
		<category><![CDATA[language]]></category>
		<category><![CDATA[pageTracker]]></category>
		<category><![CDATA[rest]]></category>
		<category><![CDATA[source]]></category>
		<category><![CDATA[wikipedia]]></category>

		<guid isPermaLink="false">http://task3.cc/?p=295</guid>
		<description><![CDATA[As assignment for Data Structures and Algorithms course, we had to work with a modified version of the quicksort algorithm. It came obvious that for modifying a qsort you need to implement it It is difficult to find a clear quicksort algorithm implemented, so I wrote it. Here is the generic C implementation of the [...]]]></description>
		<wfw:commentRss>http://task3.cc/295/a-generic-quicksort-implementation-in-c/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Two IT guys and DSA assignments</title>
		<link>http://task3.cc/281/two-it-guys-and-dsa-assignments/</link>
		<comments>http://task3.cc/281/two-it-guys-and-dsa-assignments/#comments</comments>
		<pubDate>Sat, 15 Mar 2008 23:18:39 +0000</pubDate>
		<dc:creator>bodom_lx</dc:creator>
				<category><![CDATA[Misc]]></category>
		<category><![CDATA[Unibz]]></category>
		<category><![CDATA[algorithms]]></category>
		<category><![CDATA[data structures]]></category>
		<category><![CDATA[life]]></category>

		<guid isPermaLink="false">http://task3.cc/two-it-guys-and-dsa-assignments/</guid>
		<description><![CDATA[This is what happens if you give to two IT students a stressful assignment of &#8220;Data Structures and Algorithms&#8221;, 48 hours of their meaningful life, the loss of a saturday night, and the 6th floor of the most recent building of the Free University of Bolzano: ..they begin to behave like real IT guys..and to [...]]]></description>
		<wfw:commentRss>http://task3.cc/281/two-it-guys-and-dsa-assignments/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Sorting array elements with C language</title>
		<link>http://task3.cc/274/sorting-array-elements-with-c-language/</link>
		<comments>http://task3.cc/274/sorting-array-elements-with-c-language/#comments</comments>
		<pubDate>Sat, 23 Feb 2008 14:09:59 +0000</pubDate>
		<dc:creator>bodom_lx</dc:creator>
				<category><![CDATA[Programming]]></category>
		<category><![CDATA[algorithms]]></category>
		<category><![CDATA[C language]]></category>
		<category><![CDATA[code]]></category>
		<category><![CDATA[data structures]]></category>
		<category><![CDATA[Download]]></category>
		<category><![CDATA[elements of]]></category>
		<category><![CDATA[java]]></category>
		<category><![CDATA[javascript]]></category>
		<category><![CDATA[language]]></category>
		<category><![CDATA[pageTracker]]></category>
		<category><![CDATA[pointer]]></category>
		<category><![CDATA[pointers]]></category>
		<category><![CDATA[rest]]></category>
		<category><![CDATA[source]]></category>
		<category><![CDATA[tiny c]]></category>
		<category><![CDATA[Unibz]]></category>
		<category><![CDATA[wikipedia]]></category>

		<guid isPermaLink="false">http://task3.cc/sorting-array-elements-with-c-language/</guid>
		<description><![CDATA[UPDATE 17:19: it seems that the program I implemented today uses a kind of Bubble Sort algorithm, give it a try, it&#8217;s quite interesting! After 3 long days studying C, I think I&#8217;ve assimilated a good knowledge base for the incoming semester. So there is a tiny C program that sorts the elements of a [...]]]></description>
		<wfw:commentRss>http://task3.cc/274/sorting-array-elements-with-c-language/feed/</wfw:commentRss>
		<slash:comments>3</slash:comments>
		</item>
	</channel>
</rss>
