a set of C++ genetic algorithm objects. The library includes tools for using genetic algorithms to do optimization in any C++ program using any representation and genetic operators. Part seems to be GPL (drats)
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
an effort to develop parallel solver algorithms and libraries within an object-oriented software framework for the solution of large-scale, complex multi-physics engineering and scientific applications. A unique design feature of Trilinos is its focus on
a tool to optimize the placement of rectangles in a band of semi-infinite size (2D bin packing problem). It can be useful for cutting stocks in trucks and factories.
The genericity of seq++ is ensured by the possibility of storing and working with any kind of sequence based on any alphabet (DNA, proteins, codons, others...)
a word stemming library that uses Porter algorithms. Stemming refers to stripping a word down to a simpler prefix. This is useful for "fuzzy" word matching by finding common prefixes between similar words.
a graph editor and a C++ algorithm library essentially concerned with planar graphs. The editor is particularly intended for graph theoretical research.
"small" pieces of geometric software available on the Internet. Most of the software is available free of charge. Unless otherwise specified, C or C++ source code is available for all programs.