Genetic Algorithm File Fitter, GAFFitter for short, is a tool based on a genetic algorithm (GA) that tries to fit a collection of items into as few as possible volumes of a specific size. For example, the items might be files/directories and the volumes might be CDs or DVDs. The task of arranging items in such manner that the number of required bins is minimized is called Bin Packing, a NP-hard combinatorial problem for which no deterministic polynomial-time algorithm is known. Using heuristics, such as GAs, it is usually possible to approximate -- and often reach -- the best solution for the problem within a reasonable time.
Traduki is a free machine translation system written in C/Lua. It works by creating an interlinguistic representation of text in Lua tables, the representation being somewhat modelled on the generative grammar of Noam Chomsky. Traduki aims to feature support for less common languages.
Player provides a language-independent networked interface to robots and their sensors. Supported devices include Pioneer 2DX robots with sonar, odometry & compass, SICK laser rangefinder, ACTS color vision system, GPS, gripper and wireless communications. Stage provides a population of simulated Player devices. Controllers designed using Stage have been shown to work unchanged on real robots and vice versa. Stage aims for low-fidelity simulation of many devices, rather than perfect models.
The Orbital library is a Java class library providing object-oriented representations and algorithms for logic, mathematics, and computer science. It comprises theorem proving, computer algebra, search and planning, as well as machine learning algorithms. Generally speaking, the conceptual idea behind the Orbital library is to provide extensional services and components that surround the heart of many scientific applications, hence the name "Orbital library". In order to satisfy the requirements of high reusability, the design of this foundation class library favors flexibility, conceptual simplicity, and generalization. Many sophisticated problems can be solved easily with its adaptable components.
Inlab-Scheme is an independent implementation of the algorithmic language Scheme and conforms to the R4RS and the IEEE Standard 1178. In addition to the language core, Inlab-Scheme has support for image processing which allows the implementation of OCR and image recognition applications. Inlab-Scheme comes with two built in graphic file format converters which convert the PATIMG patent file format and the ST.33 patent file format to multipage TIFF without decompressing.
Fuzzy machine learning framework is a library and a GUI front-end for machine learning using intuitionistic fuzzy data. The approach is based on the intuitionistic fuzzy sets and the possibility theory. Further characteristics are fuzzy features and classes; numeric, enumeration features and features based on linguistic variables; user-defined features; derived and evaluated features; classifiers as features for building hierarchical systems; automatic refinement in case of dependent features; incremental learning; fuzzy control language support; object-oriented software design with extensible objects and automatic garbage collection; generic data base support through ODBC; text I/O and HTML output; an advanced graphical user interface based on GTK+; and examples of use.
Mimas Toolkit is a C++ computer vision toolkit. It is easy to use and includes tools for edge detection, corner detection, various filters, optic flow, tracking, blob analysis, Web cam tools for real-time applications, and much more. It also includes many implementations of traditional algorithms such as Canny. It was developed for GNU/Linux but as the GUI is largely separate, porting to other platforms should be straightforward.
aiParts is a set of C++ classes that can be used to implement artificial intelligence, including classes that implement the HighHope technique. Sample programs include "find the shortest path" and "assign people and/or equipment to projects". A problem assembled from subclasses of the High-Hope classes knows how to solve itself by searching for a good solution.