Search Results for "genetic algorithm software"

PREESM provides a complete framework for fast prototyping. It generates a simulation and an optimized multiprocessor code from graph descriptions of algorithm and architecture. Please visit the project homepage at http://preesm.sourceforge.net.

Dinapter automatically generates a mapping between methods of incompatible components/services based on their public interfaces and behaviors. It uses a combination of expert system and A* algorithm. Dinapter is the prototype resulting from a couple of research papers: * J.A. Martín, E. Pimentel. Automatic Generation of Adaptation Contracts, FOCLASA'08, ENTCS, 2008 - http://goo.gl/21iJZ * J.A. martín, E. Pimentel. Dinapter: Automatic Adapter Specification for Software Composition, PROLE'08, ENTCS, 2008 - http://goo.gl/VrQvG ...and later integrated and improved within the ITACA toolbox (http://itaca.gisum.uma.es/): * J. ...

value

DASM is a new simple platform which helps programmer to implement and evaluate any distributed algorithm. Programmer can implement his/her distributed algorithm using DASM primitives and monitors the results in diagrams during execution.

breve is a free, open-source 3D multi-agent simulation package designed for simulating decentralized systems and artificial life.

distDES is a Java RMI-based application which manages load balancing on heterogeneous clusters. Development will extend the theoretical initial implementation to include clustered Rainbow Table generation and encryption algorithm collision detection.

A java framework for developing meta-heuristics that supports the use of grids environments. The meta-heuristics planned to be realeased are GAs, VNS and NNs. The grid middleware that will be firstly explored is the OurGrid solution.

IslandEv distributes a Genetic Algorithm (like <a href="/projects/jaga">JaGa</a>) across a network (see <a href="/projects/distrit">DistrIT</a>) using an island based coevolutionary model in which neighbouring islands swap migrating individuals every

A java library to demonstrate an algorithm to coordinate First Order multi-party interactions. This algorithm could be used to implement concepts in distributed coordinated computing including the Multi-way Rendezvous statement.