A Tcl extension for genetic/evolutionary algorithm processing. It is using the GAUL library for the core functionality.
Bin Packing problem solved using Genectic Algorithm
This project contains a solution for a Bin Packing problem solved using Genectic Algorithms. The code in the project was created as a solution for a problem in a combinatorial optimization class at the Univeridade Federal do Rio Grande do Sul (UFRGS - Brasil) in 2007.
JNSGA2 is a Java library with an implementation of the multi-objective genetic algorithm NSGA-II published by Deb et al.
A Software for Flexible Job Shop Scheduling
Flexible job shop scheduling problem (FJSP) is very important in many fields such as production management, resource allocation and combinatorial optimization. In the real manufacturing systems, each operation could be processed on more than one machine and each machine can also process several operations. This feature is known as flexibility. You can define your problem in this software and get an optimal solution as a Gantt Chart. This software is based on my M.Sc. thesis of Shahed university (Tehran, Iran).
NaruGo is game AI project. Current targets are GO board game and Texas Holdem poker. It investigates Genetic programming to build game AI logic. Also EA/GP simulations for TSP, Graph layout and Prisoners Dilemma problem.
This sofware is designed to help different chess clubs to set up their own rating system. It uses USCF approximation formulas for rating calculations. Working example at newarkcc.vfutbole.ru
uCOS-III porting for STM32F2xx (STM322xG-EVAL)
The Airs GPT project experiments with Steady State Genetic Programming create agents that play tag. It emphasises co-evolution through competition, and provides the user with some tools to help them visualize what is taking place.
NEW OPTIMIZATION TECHNOLOGY & PLANNING EXPERIMENT. Technology is designed for multidimensional optimization practical problems with continuous object functions. Technology higher efficiency than traditional optimization methods.
Formicidae is the official simulator and visualizer for the Ant-Wars competitive programming site, written in Java and SISC. The site is hosted at www.ant-wars.net.
This project is a Genetic Algorithm engine able to be reused for other projects with minimal additional programming. To use GA to search for a problems solution, program a fitness function, the project settings, and a few virtual functions.
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.
The Mars Rover Simulator project is based on the evolutionary robotics paradigm where an artificial agent acquires its skills through the process of artificial evolution. This simulator can be useful to evolve neural network controllers for the rover
Demo of Simulink to C++ C or HDL FGA for HFT potential
Video and files download for Visual trading idea to C++ or FPGA HFT Meetup File download sample: test model (Matlab 2014b with Visual Studio 2013 C++ project generated) Powerpoint MATLAB SIMULINK http://quantlabs.net/blog/2015/04/video-and-files-download-for-visual-trading-idea-to-c-or-fpga-hft-meetup/
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
Testbed for playing with the algorithm "pagerank" of Google
Provide a testbed to play with pagerank-like algorithm on graph. You can easily add vertices, edges, save the graph for reuse, etc. For now, only Pagerank is implemented, but in the future, other algorithms will be added.
Academic project aiming to write an alife Avida-like program in java.
RobGP is a genetic programming system written from the ground up in C++. It's primary goals are efficiency, ease of use, and extensibility. It's distinguishing feature is that it has a modified version of Koza's architecture altering operations.
A library for Cartesian Genetic Programming (CGP.) This project includes a simple Evolution Strategy library that can be used for evolution.
Agenda desenvolvida em Java, utilizando banco PostGreSQL. Itens: Cadastro de Contatos Cadastro de Tarefas
For each Date/Time since 1582-Oct-15 (start Gregorian Calendar): ++ add/sub days&hh:mm:ss - considered all leap years; summer time DST ++ compute start/end of DST ++ compute UTC (Greenwich) to local/DST ++ weekdays ++ Excel compatible date value
The Neo A.I Framework is a group of technologies and tools used to create A.I like software or software with A.I integrated into it
pgapack, the parallel genetic algorithm library is a powerfull genetic algorithm library by D. Levine, Mathematics and Computer Science Division Argonne National Laboratory. The library is written in C. PGAPy wraps this library for use with Python.
AAARF, written in PERL and with numerous adjustable parameters, identifies sequence overlaps in small shotgun sequence datasets and walks them out to create long pseudomolecules representing the most abundant repeats in a genome.