Search Results for "can="

A deap is a doubly priority queue for efficient data operations. Both insertion and deletion operations take O(log(N)) time. Access of min or max takes constant time. It can be useful when both min and max are needed in the queue. It can also be used in situations where the number of items is too large and items with low priorities can be dropped with keep memory footprint small.

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

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.

A self-contained, fully configurable Java "game" to simulate multi-species evolution. Design species by optionally specifying every attribute; modify any or all environmental settings; let them loose to eat, fight, procreate, die, and Evolve!

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.

Sleepwalker aims to provide a highly abstract, universal, reusable, extensible Java-based genetic algorithms framework which can be used as a basis for modelling and programming virtually any practical optimisation problem.

...Evolve them (and control flow) as cycles of arrays in arrays with size constraints based on other array sizes (at specific index) in terms of range, multiply, exponent, or permutation. No working code yet. Whats there now is an extension of GigaLineCompile which would become part of Human AI Net, but there are other projects to finish before I can come back to this one.

This software is to help the those connected with Biology,Biotechnology,Bio Informatics.The user can select from the choices of proteins, nucleotides,etc(All those found on NCBI's website)and search for the specific results

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.

M+ Compiler/Interpreter is a interpreter library written in Java that delivers the possibility to extend any Java application with simple scripts. Besides the usage of native datatypes and operations you can instantiate and call native Java objects.

A Java implementation of the NEAT algorithm as created by Kenneth O Stanley. Also provides a toolkit for further experiments to be created and can provide both local and distributed learning environments.

MAIF is developed in Java 5 (especially Generics) and aims at building AI algorithms, by concentrating onto the mapping of real-world problems, while abstracting from their inner working. It can be extended with new algorithms and problem representations.

unEvo is an Eclipse plug-in that provides support for the experimentation and research process on Evolutionary Algorithms, intended so that the user can implement an evolutionary algorithm without lost time in the code of the algorithm.