Search Results for "using"

The ASCO project aims to bring circuit optimization capabilities to existing SPICE simulators using a high-performance parallel differential evolution (DE) optimization algorithm. It supports Eldo, HSPICE, LTspice, Spectre, and Qucs.

Implementation of Point Symmetry-based Automatic Clustering Approach Using Differential Evolution Using bug fixed KD tree nearest neighbor search from https://github.com/CristianDallos/kmeansclustering. (It is also modified to search for multiple nearest points instead only for one.) Used those academic works for algorithm implementation: http://cs.cug.edu.cn/teacherweb/gwy/Publication/ISICA-09.pdf http://www.isical.ac.in/~sanghami/ieeetkde_cameraready.pdf http://www.softcomputing.net/smca-paper1.pdf 1. ...

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

EASEA (EAsy Specification of Evolutionary Algorithms: pronounce "easy") is a high-level language dedicated to the specification of evolutionary algorithms. EASEA up to version 0.7 compiles .ez specification files into C++ or JAVA object files.

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

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.

...However, along with its rapid development, the data magnitude and analysis complexity for NGS far exceed the capacity and capability of traditional small-scale computing facilities, such as multithreading algorithms on standalone workstations. To address this issue, here we present a solution using the ever-increasing supply of processing power by massive parallel processing (MPP) systems.

libfgen is a library that implements an efficient and customizable genetic algorithm (GA). It also provides particle swarm optimization (PSO) functionality and an interface for real-valued function minimization or model fitting. It is written in C, but can also be compiled with a C++ compiler. Both Linux and Windows are supported.

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.

Framework for development of simple evolutionary algorithms / island models programs in distributed environment using MapReduce programming model based on hadoop.

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.

http://jocdelavida.piposerver.com - Online implementation of Conway's Game of the Life 0 players game, but using entities based on the nature, like animals or plants who born, grow up, reproduces breed and die. Written in Java 6 and Adobe Flex 3.

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

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.

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

A Tcl extension for genetic/evolutionary algorithm processing. It is using the GAUL library for the core functionality.

Simulation of plants, prey, and predators, using sense->think->action paradigm with neural net processing. Reproduction and mutation implemented.

OW.NET -- 1-Wire API port from Java (and J#) to C#. Use the Dallas 1-Wire and iButton chips with standard C# using a serial adapter (also CF.net) or the TMEX drivers on the Windows platform. No J# distribution installation required.

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.

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.

A Visual Studio .NET C++ application can perform machine learning using genetic algorithm, naive bayes, KNN, and Artificial Neural Networks (ANNs) read and processed from any standard ARFF.

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.

In silico evolution of biochemical networks using a genetic algorithm combined with a rule-based biochemical network model.