Select a tag to browse associated projects and drill deeper into the tag cloud.
EO is a template-based, ANSI-C++ evolutionary computation library which helps you to write your own stochastic optimization algorithms insanely fast. With the help of EO, you can easily design evolutionary algorithms that will find solutions to virtually all kind of hard optimization problems ... [More]
μlatencyd is a daemon that optimizes the Linux kernel behavior by using heuristic and cgroups. The daemon uses lua scripts for most heuristic logic.
Wintermute is the attempt of Danté Ashton and a group of others to implement the world's first personal edition of an intelligent framework of applications and libraries, and in the future, an intelligent operating system. This is the brainchild of the [http://www.thesii.org/ SII]. Wintermute ... [More]
A stochastic method for planning decomposition, called Divide-and-Evolve, that was introduced recently and which focuses on plan quality. The basic principle is to search the space of state decompositions of the planning problem at hand by means of artificial evolution: candidate solutions are ... [More]
This code is part of the site Justin Heyes-Jones has been running since 2001, teaching folk about the A algorithm. See http://www.heyes-jones.com/astar.html to learn more. The code is designed to be easy to understand, easy to add your own runtime debugging monitoring the open and closed lists ... [More]
The MOEA Framework is an open source Java library for developing and experimenting with multiobjective evolutionary algorithms (MOEAs) and other general-purpose optimization algorithms and metaheuristics. A number of algorithms are provided out-of-the-box, including NSGA-II, ε-MOEA, GDE3 and ... [More]
Argorha Pathfinding is an algorithm which permit you to find your way into a polygon soup ( 3D world ) efficently by precalculating a system of sectors and portals. It is integrated into GOOF Editor and can be used without that editor. AStar included.
METSlib is an OO (Object Oriented) metaheuristics framework in C++. Model and algorithms are modular: all the implemented search algorithms can be applied to the same model and personalized algorithms can be applied to very different models. METSlib implements the basics of some metaheuristics ... [More]
A implementation of of the following algorithms to solve instances of the Rush-Hour Puzzle: Uniform-cost search, Pure-Heuristic search, A, IDA, Enhanced IDA, RTA These are all implemented using JAVA.