Contains two functions. The one function computes the greatest common divisor (gcd) of two polynomials a(x) and b(x) over GF(2^m). The other function performs the extended Euclidean algorithm where two polynomials u(x) and v(x) is calculated in addition to the gcd of a(x) and b(x) such that gcd = u(x)a(x) + v(x)b(x).
An object oriented library of an Genetic Algorithm, implemented in Java. Clear separation of the several concepts of the algorithm, e.g. Gene, Chromosome, Genotype, Phenotype, Population and Fitness Function. The fitness calculation is parallelized.
A similar to Tripwire, file system integrity checking tool but develop in java and cross platform. This tools checking and source control using check sum algorithm like MD5, SHA and CRC. It provide generate current file integiry checksum record to...
A Java workbench and toolkit for developing, evaluating, and playing with classical and state-of-the-art optimization algorithms on standard benchmark problem domains; including reference algorithm implementations, graphing, visualizations and...
A Java based, pMars compatible, CoreWars simulator with Genetic Algorithm warrior evolver functionality. Java 6 is needed. Run with the following command: java -jar CWEvolver-0.4.jar --debug --size 300 validate.red
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...
LEA is a lightweight eyetracking algorithm library (hence the name) written in and for Java. LEA is able to track eye movements with an ordinary webcam and returns relative movements (up, down, ...). It is also able to compensate for slight head...
LineFold is a Java 6 implementation of the TeX paragraph line-breaking algorithm.
Java API for implementing any kind of Genetic Algorithm and Genetic Programming applications quickly and easily. Contains a wide range of ready-to-use GA and GP algorithms and operators to be plugged-in or extended. Includes Tutorials and Examples.
This program solves the planar (Euclidean) Traveling Salesman Problem (TSP). The heuristic algorithm provides seemingly good solution. Full version includes:1. This application with file input/output enabled.2. DLL containing the algorithm.3. VCL...
SpeedyGA is a vectorized implementation of a genetic algorithm in the Matlab programming language. Without bells and whistles, it faithfully implements the specification for a Simple GA given on pgs 10, 11 of M. Mitchell's GA book. See comments in...
QT clustering algorithm as described in:
Heyer, L. J., Kruglyak, S., Yooseph, S. (1999). Exploring expression data: Identification and analysis of coexpressed genes. Genome Research 9, 1106d-deOCt1115.
Java framework for applying meta-heuristic (multi-objective) optimization algorithms like an Evolutionary Algorithm, Particle Swarm Optimizer, Differential Evolution, or Simulated Annealing to arbitrary optimization problems.(visit:...
JNSGA2 is a Java library with an implementation of the multi-objective genetic algorithm NSGA-II published by Deb et al.
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.
GAIA is a framework that allows OO projects to use Genetic Algorithm mechanisms to solve optimization and best solution search problems. With a set of specialized classes and a configuration file, any java application can abstract the GA logic.
This package has a collection of readily usable genetic operators for order based genetic algorithm and is implemented using java.
X-GAT (XML-based Genetic Algorithm Toolkit) is a Java framework to optimize problems with Genetic Algorithms (GAs). Differently from other frameworks, X-GAT contains ready-to-use GAs implementations and new features can be easily added.
DSA extensions contains classes similar in purpose to the classes provided in java.util.
Currently, it contains sortable Lists and Maps, as well as a balanced binary search tree and a binary array search algorithm.
The BalanceLine4j Project is an implementation of the Balance Line Algorithm for Java applications. The Balance Line is an algorithm used to make Coordinated Processing and Sequential Updates, that improves performance and saves machine resources. |