a collaborative effort to help deliver large, freely-downloadable content using peer-to-peer technology. The network is essentially a huge "virtual web server"
In k-means clustering we are given a set of n data points in d-dimensional space and an integer k, and the problem is to determine a set of k points in d-space, called centers, so as to minimize the mean squared distance from each data point to its neares
file-synchronization tool for Unix and Windows. It allows two replicas of a collection of files and directories to be stored on different hosts (or different disks on the same host), modified separately, and then brought up to date.
to research and develop software that contributes to compelling and effective social interactions, with a focus on user-centered design processes and rapid prototyping.
Memetic Algorithms is a population-based approach for heuristic search in optimization problems. They have shown that they are orders of magnitude faster than traditional Genetic Algorithms for some problem domains.
THESIS submitted by Antony ROBERT to the Faculty of Science of the University of Fribourg (Switzerland) in conformity with the requirements for the degree of Doctor scientiarum informaticarum