Open Source Mac Algorithms - Page 14

GEECoP (Graphical Editor and Engine for Constrained Processes) is a tool to graphically design control-flow graphs and their associated constraints. It supports creation of Concurrent Transaction Logic formulas and validation of constrained processes.

This project is using genetics algorithms to complete scheduling tasks such as timetables for elementary / high schools etc. Currently NetBeans project with no GUI and simple HTML export.

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.

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.

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

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

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.

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.

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

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

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.

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.

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); [...] }

GoDS, which means "Go Data Structures", is an implementation of various data structures and algorithms in Go. It provides a wide variety of containers (Sets, Lists, Stacks, Maps, Trees), sets (HashSet, TreeSet, LinkedHashSet), lists (ArrayList, SinglyLinkedList, DoublyLinkedList), stacks (LinkedListStack, ArrayStack), maps (HashMap, TreeMap, HashBidiMap, TreeBidiMap, LinkedHashMap), trees (RedBlackTree, AVLTree, BTree, BinaryHeap), comparators, and iterators. Containers are either ordered or unordered. All ordered containers provide stateful iterators and some of them allow enumerable functions. A list is a data structure that stores values and may have repeated values. A list backed by a dynamic array that grows and shrinks implicitly. A list where each element points to the next element in the list. A set is a data structure that can store elements and has no repeated values. A Map is a data structure that maps keys to values.

A Java library and set of tools to quickly and easily manipulate graphs (set of nodes and edges) and dynamic graphs. The principal trait of this library is its ability to manage (create, edit, layout, display) continuously evolving graphs. The development of this project now takes place on Github. Visit the official Graphstream website at http://graphstream-project.org

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

NOTE: The GROOVE codebase has moved to https://github.com/nl-utwente-groove