Open Source Algorithms

Technical analysis library with indicators like ADX, MACD, RSI, Stochastic, TRIX... includes also candlestick pattern recognition. Useful for trading application developpers using either Excel, .NET, Mono, Java, Perl or C/C++.

ViennaCL provides high level C++ interfaces for linear algebra routines on CPUs and GPUs using CUDA, OpenCL, and OpenMP. The focus is on generic implementations of iterative solvers often used for large linear systems and simple integration into existing projects.

MultiBoost is a C++ implementation of the multi-class AdaBoost algorithm. AdaBoost is a powerful meta-learning algorithm commonly used in machine learning. The code is well documented and easy to extend, especially for adding new weak learners.

An open source workbench for chemo- and bioinformatics built on the Eclipse Rich Client Platform (RCP).

Alef++, is a new programming language like Perl and Lisp syntax, with a many changing in classical languages designs, her specification designed to be implemented for any VM, by default can access to any private/protected/default Java fields or methods.

Korat is a tool for constraint-based generation of structurally complex test inputs for Java programs.

Common Java data structure library used by multiple projects. See http://verdantium.blogspot.com/

Sinalgo is a simulation framework for testing and validating network algorithms. It allows for quick prototyping and verification in freely customizable network settings. It is mainly suited for packet-oriented wireless networks.

That project (RMOL) aims at giving developers concerned by the Revenue Management arena a library delivering a reference implementation for most of the published algorithms and methods. That library is intended to be used in simulated environment: it does not intend to be used in real world production systems.

The Free Connectionist Q-learning Java Framework is an library for developing learning systems. Keywords: qlearning, artificial intelligence, alife, neural nets, neural networks, machine learning, reinforcement learning unsupervised learning agents lejos

TimeFinder automatically optimizes schedules (timetables) for universities and high schools. It makes manual timetabling for the timetabler easier via a Java GUI. Export+import is supported via xml and text formats. http://timefinder.sourceforge.net/

libconhash is a consistent hashing libraray, which can be compiled both on Windows and Linux platform. High performance, easy to use, and easy to scale according to node's processing capacity.

PortugolViana é uma ferramenta open-source para edição/execução algorítmica. PortugolViana permite a edição de algoritmos em português (do Brasil e de Portugal) e a sua execução e monitorização.

Ropes are a scalable string implementation that are designed for efficient operation by utilizing lazy operations such as concatenation and slicing. This is a python C module which implements ropes for pythons.

A univariate and multivariate analysis UI. This project is no longer under development. Please use as you wish.

Sudoku Maker is a generator for Sudoku number puzzles. It uses a genetic algorithm internally, so it can serve as an introduction to genetic algorithms. The generated Sudokus are usually very hard to solve -- good for getting rid of a Sudoku addiction.

TSPSG is intended to generate and solve Travelling Salesman Problem (TSP) tasks. It uses Branch and Bound method for solving. An input is a number of cities and a matrix of city-to-city travel prices. The matrix can be populated with random values in a given range (useful for generating tasks). The result is an optimal route, its price, step-by-step matrices of solving and solving graph. The task can be saved in internal binary format and opened later. The result can be printed or saved as PDF, HTML, or ODF. TSPSG may be useful for teachers to generate test tasks or just for regular users to solve TSPs. Also, it may be used as an example of using Branch and Bound method to solve a particular task.

darknocK detects edges in images. It is using Artificial Neural Networks to enchance the results of standard algorithms.

NaruGo is game AI project. Current targets are GO board game and Texas Holdem poker. It investigates Genetic programming to build game AI logic. Also EA/GP simulations for TSP, Graph layout and Prisoners Dilemma problem.

This project consists of various implementations of the Graphplan algorithm. At the moment we have two implementations of Graphplan: * Emplan - A C++ implementation for Linux, Windows and MacOS X * JavaGP - A Java implementation

Hyacc is an efficient and practical Yacc/Bison-compatible full LR(1)/LALR(1)/LR(0) and partial LR(k) parser generator in ANSI C based on Knuth and Pager's LR(1) algorithms. Generated parser can be used in open-source or commercial software.

Java Machine Learning Library is a library of machine learning algorithms and related datasets. Machine learning techniques include: clustering, classification, feature selection, regression, data pre-processing, ensemble learning, voting, ...

A markup language for expressing knitting patterns which can serve as a software interchange format

A Java implementation of the NEAT algorithm as created by Kenneth O Stanley. Also provides a toolkit for further experiments to be created and can provide both local and distributed learning environments.

The main goal of OWLVE is to visualize graphically any OWL–lite file. Using powerful RCP and GEF technologies will improve the quality of graphics and diagrams.This project includes an algorithm for similarity calculus between two OWL files.