Search Results for "parallel genetic algorithm" - Page 2

This project provides a set of Python tools for creating various kinds of neural networks, which can also be powered by genetic algorithms using grammatical evolution. MLP, backpropagation, recurrent, sparse, and skip-layer networks are supported.

See the new project page: https://nojhan.github.io/paradiseo/ (Archived project page: http://eodev.sourceforge.net/)

CRFSharp(aka CRF#) is a .NET(C#) implementation of Conditional Random Fields, an machine learning algorithm for learning from labeled sequences of examples. It is widely used in Natural Language Process (NLP) tasks, for example: word breaker, postagging, named entity recognized, query chunking and so on. CRF#'s mainly algorithm is the same as CRF++ written by Taku Kudo. It encodes model parameters by L-BFGS. Moreover, it has many significant improvement than CRF++, such as totally parallel encoding, optimizing memory usage and so on. ...

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.

Project aim to provide simple easy APIs for Java developers to use interactive abilities in their Java Applications like speech recognition, handwriting recognition, use of web cam , sound record/play, decision trees , text to speech and many others.

Developed as a final year project at Islamic University of Technology (IUT) during 2010 - 2011 academic year. This code is a simple implementation of real coded genetic algorithm for numerical optimization. Code is written in C/C++.

A genetic algorithm in Python for evolving programs that write a given string to an allocated dataspace, using a made-up machine language with only 7 instructions and flow reversal.

This project is a complete cross-platform (Windows, Linux) framework for Evolutionary Computation in pure python. See the project site at http://pyevolve.sourceforge.net or the blog at http://pyevolve.sourceforge.net/wordpress

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.

Mainly include the codes of genetic algorithm, interative genetic algorithm, that are written in Java Applcations also included such as function optimization, simple fashion design optimization, face optimization and so on

Based on the introduction of Genetic Algorithms in the excellent book "Collective Intelligence" I have put together some python classes to extend the original concepts.

Parallel Reinforcement Evolutionary Artificial Neural Networks (PREANN) is a framework of flexible multi-layer ANN's with reinforcement learning based on genetic algorithms and a parallel implementation (using XMM registers and NVIDIA's CUDA).

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.

This easy to run and change program for developers, it contains several evolutionary based strategies allowing you try among some function samples

Open BEAGLE is a C++ Evolutionary Computation (EC) framework. It provides an high-level software environment to do any kind of EC, with support for tree-based genetic programming; bit string, integer-valued vector, and real-valued vector genetic algorithms; and evolution strategy. The Open BEAGLE architecture follows strong principles of object oriented programming, where abstractions are represented by loosely coupled objects and where it is common and easy to reuse code. Open BEAGLE is...

POGA - Parameter's Optimization by Genetic Algorithm - Developed by Leonardo Santos (LAC-INPE :: santoslbl@gmail.com) and José Miranda (IF-UFBA :: vivas@ufba.br). 114 Downloads of the first version. Second version avaliable.

This is implementation of parallel genetic algorithm with "ring" insular topology. Algorithm provides a dynamic choice of genetic operators in the evolution of. The library supports the 26 genetic operators. This is cross-platform GA written in С++.

GAAF is a tool for analyzing Genetic Algorithms (GA for short). It allows to check the behavior of a particular GA resolving a particular problem so one can get empirical information to decide which GA best fits problem's conditions.

This is C++ application code that implements Gene Expression Programming, or GEP - a form of genetic algorithm.

TrimGA is a lightweight genetic algorithm library written in pure Java 6.0 that can be quickly applied to most optimization problems.

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.

Springbots is a python application which takes a set of 2d physical structures built with nodes and movable springs and evolve them for specific tasks like walking, swimming and jumping using genetic algorithm.

A flexible and easy-to-use toolkit for implementing genetic algorithm in Python

The Automatic Model Optimization Reference Implementation, AMORI, is a framework that integrates the modelling and the optimization processes by providing a plug-in interface for both. A genetic algorithm and Markov simulations are currently implemented.

JNSGA2 is a Java library with an implementation of the multi-objective genetic algorithm NSGA-II published by Deb et al.