Search Results for "java time"

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.

Classical genetic algorithm suffers heavy pressure of fitness evaluation for time-consuming optimization problems. To address this problem, we present an efficient genetic algorithm by the combination with clustering methods. The high efficiency of the proposed method results from the fitness estimation and the schema discovery of partial individuals in current population and. Specifically, the clustering method used in this paper is affinity propagation. The numerical experiments...

Track your friends in real time on a map.. and many more features

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!

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.

It's a simpler clone of RoboCode. It's a game which simulates tanks war. The focus is artificial intelligence AI, evolutive algorithms and neural networks. It's implemented in Java.

Mr. Logister is a resource scheduling application that uses genetic algorithms to find the best utilization and allocation of resources. The scheduler understands hard constraints like free/busy time and soft constraints like suitability and preferences.

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.