Open Source BSD Library Management Software

Arageli is a C++ library for computations in arithmetic, algebra, geometry, linear and integer linear programming. Arageli provides routines and classes that support precise, i.e. symbolic or algebraic, computations.

EasyCSP is an open-source Java library for Constraint Satisfaction Programming. EasyCSP offers search algorithms for both CSPs and CSOPs. EasyCSP supports CSPs to be formalized using objects or int expressions. EasyCSP on GitHub: http://github.com/cordisvictor/easycsp-lib

S-Match is a semantic matching framework. S-Match takes any two tree like structures (such as database schemas, classifications, lightweight ontologies) and returns a set of correspondences between those tree nodes which semantically correspond to one another. S-Match contains implementations of the semantic matching, minimal semantic matching and structure preserving semantic matching algorithms. S-Match applies as a solution in many fields, including: information integration, ontology evolution and alignment, peer-to-peer information sharing, digital libraries integration, web service composition, agent communication, and query answering on the web. S-Match is extendable to host new algorithms.

A fast way to rate the reading challenging level of book or text. Unlike well known reading metrics such as Fog, Kincaid, SMOG, ARI, Flesch, and Coleman-Liau readability this metric takes into account far more factors and is standarized against a corpus

Este proyecto constituye una adaptacion y mejora del codigo ANFIS de dominio público de Roger Jang. / This project is an adaptation and improvement of the original public domain ANFIS code of Roger Jang.

Seeds is a project which implements Data structure and Algorithms! We aim for speed, flexible and the easy to use!

The toolkit glpk supports methods for mixed integer linear programming (MILP). These methods solve Capital Budgeting Problems (CBP). Unfortunately, glpk does not support any multithreading and there is no feature to distribute problems via network connections. Today, this is a pitiable sight, because modern computer systems are coupled by networks and support multi threading. We create a distributed system with Apache thrift and the C-API of glpk. Now, it is possible to use as many cores in a network as you want. With a focus on the MILP methods we implement a load balancing and speed up the solving process in a multiplicative way. Sometimes we have super-linear speedup with a small set of hardware. With a splitting of problems, parallel computing and distributing the actual best solution to all running processes we solve CBP much faster than a sequential processing can do.

Java generic API for search algorithms on graphs implicitly given by tree node expansion operator

Math4J is a java library with an object-oriented design of some mathematical ideas: functions, primality, complex numbers, etc. It also consists of some utility methods and classes for mathematical constructions.

The Rank Aggregation and Evaluation Suite is a comprehensive set of rank aggregation algorithms and performance measurement tools for use in research.

This project's goal is to implement Artificial Inteligence algorithms and make them available for any platform but especially for mobile devices. The main objective is to allow the community to develop better and more inteligent mobile games.

KNN-WEKA provides a implementation of the K-nearest neighbour algorithm for Weka. Weka is a collection of machine learning algorithms for data mining tasks. For more information on Weka, see http://www.cs.waikato.ac.nz/ml/weka/.

XMLMath evaluates mathematical, logical or textual expressions described in xml and prints the result. For example, to compute the result of 1 + 1, you would write: <add> <long value="1"/> <long value="1"/> </add>

ivl is a full-header template C++98 math library with convenient yet powerful syntax. It extends classic C++ syntax towards mathematical notation while making use of the language's elements like classes, structs, operators and functions. Expression written using ivl are excessively optimized. In other words, ivl allows writing simpler and more expressive statements using math-like formulas while taking care of optimizing them. ivl features arrays, tuples and custom function-like objects with left-right overloading, function pipelining and function vectorization, automatic lazy evaluation, sub-arrays and other views of a single or multidimensional arrays, stl-compatible iterators, multidimensional iterators and multithreading. ivl includes a rich set of functions and operators, including operations for image processing. Seperate modules are also included. The module ivl-lina implements a linear algebra LAPACK wrapper. The module ivl-cv integrates OpenCV into ivl.

JMathStudio is a Java based digital image and signal processing toolkit/library. It is simple to use, portable, light (~300 Kb), extendable and free. Full source code available at https://github.com/bhavyaajani/jmathstudio Android compatible JMathStudio is available @ https://sourceforge.net/projects/jmathstudio-android/

LR(k) parser generator (k>=0) implementation.

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.