Open Source Algorithms - Page 27

GEP is an evolutionary algorithm for function finding. This framework is a powerful way of expressing and coding genetic-like structures and quickly finding solutions through evolution by common genetic operators.

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.

This is a method for identifying graphs using MD5 hashing. It can be used for graph equality comparisons and to facilitate graph isomorphism testing. The graphs can be labeled or unlabeled.

A generic implementation of STL containers and some STL algorithms. The main intent is no make this STL implementation to work with any kind of pointers defined by allocator classes, e.g. memory_mgr::offset_ptr.

Implementation of paralell partitioning algorithms achieving an optimal number of comparisons. See L. Frias and J. Petit. Parallel partition revisited. http://dx.doi.org/10.1007/978-3-540-68552-4_11 for further reference.

NOTE: Project has been delayed due to other tasks. Genetic Algorithms General Solver (GAGENES) is a C++ implementation of the genetic algorithm concept.

This project is a genetic algorithm engine able to be reused for other projects with minimal additional programming. The genetic algorithm engine currently plays many blackjack hands for the fitness function and produces a result similar to blackjack basic strategy. To see it in action, download the zip file and run either: GABlackjack_Demo.exe     (quick)   or GABlackjack_Long.exe       (slow, but it achieves better results). The code was written in C++, using MS Visual Studio 6.0 and MS Visual Source Safe 6.0. The genetic algorithm engine supports various mutation rates, ranked parental selection, stochastic sampling parental selection, cyclic crossover, crossover at each gene, cloning the best individual each generation, and creating random individuals each generation. To use the genetic algorithm engine to search for a different problem's solution, one needs to program a fitness function, the project settings, and a few virtual functions.

This is a cross-platform framework for using Genetic Algorithms for solutions. Written in Java and uses convinient plug-in features for every phase in the genetic development, while maintaining an easy-to-use API for easy integration into applications.

This API is intended to help developers use genetic algorithms in their own java applications. GeneticLibrary.zip contains the netbeans project of the API itself. GeneticTrial.zip contains another netbeans project which is an example explaining how to use the API. docs.zip is the documentation of the API. Please take a look there, it is really helpful. I have only two request from who will use this API; USE, UPDATE AND MODIFY IT FREELY JUST NOTE THE ORIGINAL AUTHOR

This project aims to create an open source genetic algorithms (GA) library for the IBM Cell BE processor. A well-documented implementation of GAs is provided, along with a number of sample fitness functions illustrating how to use the GA library.

GFP use Genetic Programming and LISP-like language for growing program.

This is an attempt to use Genetic Programming for writing a go player in a pseudo-ASM. It is entirely written in Common Lisp.

GP@home is a new group/project dedicated to fully utilizing the combined concepts of genetic programming and distributed computing to improve the quality of life for all human beings. Nothing is impossible working together.

Genetic Programming Classifier is a distributed evolutionary data classification program. It uses the ensemble method implemented under a parallel co-evolutionary Genetic Programming technique.

Genetic Programming (tree structure) predictor within Weka data mining software for both continuous and classification problems.

The Distributed Genetic Programming Framework is a scalable Java genetic programming environment. It comes with an optional specialization for evolving assembler-syntax algorithms. The evolution can be performed in parallel in any computer network.

Genetic Programming in OpenCL is a parallel implementation of genetic programming targeted at heterogeneous devices, such as CPU and GPU. It is written in OpenCL, an open standard for portable parallel programming across many computing platforms.

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.

This project aims at providing a set of tools for solving the class of monodimensional packing problems (such as cutting stock, bin packing and knapsack problem) mainly using genetic algoritms.

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.

GeoPDEs is a suite of software tools for research on Isogeometric Analysis of PDEs. GeoPDEs is free software implemented in Octave and fully compatible with Matlab. GeoPDEs is no longer developed at SF, and has moved to GitHub. Please visit http://rafavzqz.github.io/geopdes/ The mailing list will remain active. Releases up to 2.0.4 can be found here. From version 2.1.0 onward, see https://github.com/rafavzqz/geopdes

Implementation of an Interval Iterative Closest Point that uses intervals to found the global optimal solution. ICP can be used in vision technologies and photogrametry as pattern mathcing and as geometrical model finder.

Cell Broadband Engine Processor optimized libraries and software from Georgia Tech, for a number of libraries for FFT, MPEG, compression, and encryption. This project also includes patches to accelerate R on the Cell Broadband Engine processor.

A C++ RAII ( Resource Allocation Is Initialization ) implementation of an automatic pointer/reference. Pointable/Referenced objects are handled in a manner similar to Python. Strives to have the simplest syntax possible.

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