TRSL is a C++ library that implements several (statistical) sampling schemes behind an (STL-like) iterator interface. The library may be used e.g. in particle filtering. It is distributed under the Boost SL (BSL is a free-software license).
A real time inference engine for temporal logic specifications
A real time inference engine for temporal logic specifications, which is able to process and generate any binary signal through Linux IPC or files. Specifications of signals are represented as special graphs and executed in real time. Accepted language provides timed logic operators, conditional operators, interval operators, bounded quantifiers and parametrization of signals.
Projet C++ de l'IUT Informatique d'Aix-en-Provence 2010 : Réalisation d'une bibliothèque de conteneurs génériques. Par Yassine AZIMANI, Benjamin DADI, Thomas DI'MECO, Guillaume MIKOLAJCZYK et Brice VALENZA.
A framework for utilising the Genetic Algorithm in the domain of Game Theory
The "HoldemHand" project will be able to provide odds for Texas Holdem hands. This project will be able to provide the user with statistical data about the odds and possibilities of Texas Holdem Poker hands.
LibPPQ is a small C++ library with templates that aims to be a "persistent" drop in replacement for the std::priority_queue template. Other than std::priority_queue however libppq limits its priorities to be unsigned integers.
The SFTL (Simple Functional Template Library) is a C++ library that attempts to leverage the use of the C++ STL through functional programming concepts.
The Strinx library is collection of string-algorithms and containers, designed for resource-efficient software development in modern multi-threaded environments.
Waterford procedurally simulates, and visualizes, demographic development.
The treexpr library is a Free Software library that applies regular expression concepts to tree structures. It it written in C and has a JNI binding to Java.
TommyDS is a C library of hashtables and tries designed for high performance.
Topologia Digital (Digital Topology) is a project for the development of the practical exercises of the Digital Topology course in the Applied Mathematics Department of the Computer Science Faculty (Polytechnic University of Madrid, Spain).
A standalone, STL interface to the Torch library's Support Vector Machine (SVM). It supports single or multiclass (one vs. all) classification using dot product, polynomial, Gaussian and sigmoid kernels.
The tree control library is a C++ container library which stores generic types in tree structures. Three containers are available in the library: tree, multitree, and unique_tree. The library usage and syntax is much like that of the STL.
This projects implements various optimization heuristics and meta-heuristics (such as local search, VND, GRASP, Simulated Annealing, and more still to come) finding solutions on the post enrolment course timetabling problem.
VIA (Visual Inteligencia Artificial) Emulación de comportamientos inteligentes en juegos de tablero. Modelado de juegos, algotirmos y heurísticas para emular comportamientos inteligentes. Control de procesos.Estadísticas de exploración
API Java de visualisation et d'interaction dans le domaine des graphes.
The T. J. Watson Libraries for Analysis (WALA) provide program analysis capabilities for Java bytecode and related languages. The WALA libraries constitute an open-source release of parts of IBM Research's DOMO analysis infrastructure.
Wallaroo is an infinite precision constraint solving and optimization library for linear constraints over the rational numbers. It handles equalities (=), inequalities (<=, >=), strict inequalities (<, >), and disequalities (!=).
J2EE Application of Frequent Behavior Path Tree on ClickStream Analysis
Simple platform independent library for comparing strings against the wildcard masks.
WIttgen is a two-instruction programming language modeled on the mind.
The Wittgen programming language consists of just two instructions and one special variable name. Wittgen allows you to assign any text string to a variable of any name. It also allows you to retrieve the text assigned to that variable. Lastly, it has a special variable called “Doing Now”. Every execution step consists of retrieving the contents of Doing Now, removing the first assign found in that content and performing that assign. In the course of performing that assign any retrieve operations indicated in the text are performed before committing the assign. That is all there the system does. The driving motivation for this design is that as far as we know, the human mind supports these two instructions.It may have additional mechanisms that create new assigns, but using the results of these mechanisms requires a system built from these instructions.
XPN is relies on a non relational native XML database, where XML documents are stored in a compressed form and indices enables fast access to structure and content, thus enabling a fast evaluation of XQuery queries.
YACS (Yet Another Constraint Solver) is a Java library and an object-oriented framework for constraint solvers. It supports propagating and solving of constraint satisfaction problems with finite and infinite domains (discrete values and real intervals).