Open Source Algorithms - Page 4

This is a python implementation that handles floating points correctly,there are still some bugs but I'm working on it . The point was to work around some stuff that made no sense for floats,like 0.1+0.2 == 0.3 is false.

FORce based Cluster Editing (FORCE) is a Java software heuristically solving the graph cluster editing problem on weighted edges using BLAST E-values. It further provides a training mode for heuristic parameter estimation.

Provides functional programming abstractions for C# including map, fold, filter functions for .NET collections, the option data type, a lazy type, a functional list type, lazy functional lists, and more. Superseded by http://sf.net/projects/sasa/

A genetic algorithm framework to allow the evolution of synapse weights and topologies of artificial neural networks.

The following code is a parallel kNN implementation that uses GPUs for the high dimensional data in text classification. You can use it to classify documents using kNN or to generate meta-features based on the distances between a query document and its k nearest neigbors

Galapagos is a Genetic Algorithm framework written in Java 5 with the intended audience of undergraduates in an Artificial Intelligence class. The goal of Galapagos is usability: a competent student should be able to learn this library in an afternoon.

GeneThello (read jə-ˈne-ˈthe-lō), is an acronym for genetic othello, an othello (reversi) playing program which based on Genetic Algorithm (GA). In principle GeneThello consist of an othello program and a genetic algorithm system.

The SP is a tool is a tool to research for automatic synthesis of protocols using genetic programming. This tool will allow the construction of heuristics to apply techniques simulation and validation of models.

Geneur is an Open Source scheduler for GRID. It is based on variation of genetic algorithms. Geneur uses backfill scheduling algorithm to create first genetic population.

in-place sorting algorithm with O(n*log(k)) time komplexity. The data have to be the structure: struct { unsigned (char/short/int/long); [...] }

This project aims to provide developers a convenient library about graph theory algorithm and some basic data structures. It will be developed in Java via Eclipse IDE, supporting both win32 and linux systems, and published as jar files.

HH-Evolver is a framework for domain-specific, hyper-heuristic evolution. HH-Evolver automates the design of domain-specific heuristics for planning domains. Hyper-heuristics generated by our tool can then be used with combinatorial search algorithms such as A* and IDA* for solving problems of the given domain.

Description: We propose and implement in C++ the hashed dynamic determinants scheme. This consists of efficient implementations of dynamic determinant algorithms and a hash table that stores intermediate results (matrices and determinants) in order to be used in subsequent steps of the algorithm. Related papers: V.Fisikopoulos, L.Peñaranda. Faster Geometric Algorithms via Dynamic Determinant Computation. In Algorithms – ESA 2012, Lecture Notes in Computer Science Volume 7501, 2012, pp 443-454.

This project aims to develop a colour-based vision processing system for use in RoboCup. We are using a CCD camera for input to an FPGA. The system locates coloured objects and outputs detected corners.

Hipo is a hypothetical computer to facilitate the learning of machine language. The student can use hipo to develop simple programs and understand the internal logic of a computer. There is a plan to implement Donald Knuth's MMIX machine language, also.

I is a cross-platform programming language designed towards efficiency during development and at runtime.

Institute of Technology, Blanchardstown Computer Science code by the class of 2007-2011 on course BN104. In this project we are open sourcing all of our project work to the public in the hopes it can be reused, built-upon, and used in education.

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

JBernstein is a tool implemented in Java that enables to check whether a polynomial constraint holds for all variables within their domain. It is mainly used in the verification or synthesis of cyber-physical systems where the system model is nonlinear. The tool also supports specifications in assume-guarantee style. The underlying algorithm is based on a translation to Bernstein polynomials, and several optimization techniques are implemented to ensure efficiency. Concerning performance, the tool enables to check all examples in the PVS Bernstein testsuite within a second, which can be an order of magnitude faster than some other tools such as QEPCAD or REDLOG. Although JBernstein uses double, it offers automatic error-estimation capabilities (experimental) so that the generated result is correct (the solver may return unknown when the error-estimate is too large)

JCortex is a complete solution that allows software developers create, educate and use Artificial Neural Networks in Java projects. Splits in two elements: JCortex Framework, an ANN Java framework; and JCortexBuilder, its graphic development environment.

Java 3D VR with basic headtracking. Basics of blob tracking, image processing. Make sure you have a webcam and an infrared led

This program benchmarks the following sorting algorithms implemented in Java: Quick Sort, Heap Sort, Merge Sort, Selection Sort, and Bubble Sort. A command line GUI was created to facilitate all your benchmark needs.

Javascript-based Parser for Smarty-templates.

Joshua chess robot: a stepper motor robot interfaced with a photosensible board to play chess with an embedded artificial intelligence, a game database or and internet player. Software, robot photos, tech papers, schematics and cabling included. Enjo