Open Source Algorithms - Page 25

Generic simple and efficient Fast Fourier Transforms (FFT) implementation using policy-based design and template metaprogramming in C++

GAKNN is a data mining software for gene annotation data. GAKNN is built with k- Nearest Neighbour algorithm optimized by the genetic algorithm. Gene annotation datasets saved under .csv or .arff formats with Gene Ontology or FunCat categorization can use GAKNN to predict gene functions.

An implementation of LAYAGEN G(Diego-Mas 2010) for solves the layout planning problem using a simple genetic algorithm, and fully written in GAMBAS

This project uses massively parallel Graphics Processing Units(GPU) for neural network(Backpropagation) purposes.

Sistema GnoSis para calibragem de ontologias

A class/library which uses the graphic card for linear algebra. Warning : you will need a GeForce 8 serie to take profit of this class.

General Toolkit Library is a general purpose toolkit written in C++ designed to make it easier for developers to produce applications. It provides classes and templates that implement several data structures like Arrays, Lists, Heaps, Sets, Files, etc.

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

This repository provides the source code for a foot-tracking algorithm using an inertial measurement unit (IMU) attached to the foot, as demonstrated in Seb Madgwick’s “3D Tracking with IMU” video (March 2011). The method performs dead reckoning to integrate foot motion and corrects for drift at each foot strike (when the foot touches the ground) to reset error accumulation. The algorithm was part of gait analysis research, estimating foot trajectories in 3D over time. The repo is marked “no longer maintained,” and has been superseded by newer versions of Gait-Tracking. Capability to compare walking trajectories in experiments. Integration of IMU data (accelerometer + gyroscope).

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.

Game Toolbox is a C# assembly designed to facilitate the creation of games and game prototypes. It contains no graphics code, does not depend on XNA, and is Mono-compatible. It provides implementations of A*, GOAP, a genetic algorithm, and more.

(REW) French Project (Research Encadred Work)... Chinese Games (Halma) created by students in License... Interesting by modifiable dynamicly AI and concept. Report, PPT, API and Install included...

The Game of Life involves cell reproduction based on its neightbors, with later modifications taking age and sickness into account.

Gamoliyas is an open source John Conway's Game of Life game totally written in DHTML (JavaScript, CSS and HTML). Uses mouse and keyboard. Very configurable. This cross-platform and cross-browser game was tested under BeOS, Linux, *BSD, Windows and other

Classroom allocation using Genetic Algorithms and restricted mutation. Developed by AIGroup: Pablo Cababie, Facundo Cancelo, Alvaro Zweig y Gabriel Barrera

The package is a Microsoft .NET 2.0 package providing the processing of the geographical data. The library supports popular "home" formats of geographical data: Ozi Explorer, MP and MPS. The library supports map nomenclature (Soviet headquarters).

The C++ library Geneva allows to run large scale parametric optimization problems. It can run in serial or multi-threaded mode or in a networked environment. The library currently covers Evolutionary Strategies, Genetic Algorithms and mixed scenarios.

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.

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 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.