This library is a lightweight implementation of genetic algorithm, contains the most popular types of chromosomes and the basic algorithms for selection, elitism, crossing and mutation.
On open source MPI implementation of parallel bucket sorting. This implementation is scalable and gives linear speedup on SGI(Altix). The program sorts at using the bits and hence is stronger than other sorters which make assumptions about keys.
This project is a highly flexible implementation of the well known bin packing algortihms: next fit, first fit, best fit, worst fit. The elements and bins may have any number of dimensions.