Tag Archives: algorithms

Pomodroid v0.7.0, now with direct task input!

It’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

On the geolocation based driver-rider matching algorithm of Dycapo

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

Announcing Dycapo Server v0.3.0 – this one is serious

It’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.

Wiki set up, first meeting

Both the Wiki and the blog has been set up. Tomorrow I’m going to have the first official meeting at FBK to discuss my first results. I’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

Hash Maps with linear probing and separate chaining

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,

A Generic Quicksort Implementation in C

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