TAC-AI is an infantry combat simulator using XML to store unit status, and pluggable AI modules to make strategic and tactical decisions. Replace the default TAC-AI modules with your own and see how your forces perform against an opponents logic.
The target of this project is to build easy, reliable, flexible and universal Java Configuration Tool.
Translate things,such as chm documents,software scripts.
This project's goal is to implement Artificial Inteligence algorithms and make them available for any platform but especially for mobile devices. The main objective is to allow the community to develop better and more inteligent mobile games.
This Shell API enables the Shell programmer to configure his shell script(s) environment thru a windows like INI file where all the environment is organized thru sections
Track your friends in real time on a map.. and many more features
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.
extend what db2 can do. developer and dba helper.
an simple thread pool in linux, based on POSIX thread API. Management thread will retrieve needless idle thread to keep in low resource consumption.
Can emulate old computer on text the code pogram ideal to create kernel for operating system The begin the project the can emulate CPU(8080)and z80.
In silico evolution of biochemical networks.
In silico evolution of biochemical networks using a genetic algorithm combined with a rule-based biochemical network model.
small library to ease the task of calling callback functions
compactpath is a python package to handle compacting of filepaths. compacting of filepaths may be useful in gui programming where filepaths of arbitrary lenght have to be displayed in widgets with limited visual space.
Algorithms that run our universe | Your personal library of every algo
Distributed Island Model Genetic Algorithm (C++, TCP/IP)
Deap is a doubly heap for both min and max number access.
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.
My personal academic projects that might be useful for anyone who need LANChat application or Similarity measurement with edit distance algorithm.
GenericJ is an attempt at have generic classes built on top of the Collection Framework in Java. This also intends to support programmic database, network, thread, EJB's, Servlet's classes present in the Java Framework.
A .net implementation of a framework for genetic algorithms. This tool enables programmers to write the "core" of their problem and have a genetic algorithm immediately setup for solving it.
A GPU-based efficient data parallel formulation of the kNN problem
A GPU-based efficient data parallel formulation of the k-Nearest Neighbor (kNN) search problem which is a popular method for classifying objects in several fields of research, such as- pattern recognition, machine learning, bioinformatics etc.
Simple genetic programming framework. Features a robust set of interfaces and standard implementations for rapid development and ease of experimentation.
A library for Cartesian Genetic Programming (CGP.) This project includes a simple Evolution Strategy library that can be used for evolution.
"libcord" is a set of general-pupose libraries written as additions to standard libraries of C, Lua and Python.
A Multi-objective evolutionary algorithm library
This is a header-only memory pool library for C++