JGAP is a Genetic Algorithms and Genetic Programming package written in Java. It is designed to require minimum effort to use, but is also designed to be highly modular. JGAP features grid functionality and a lot of examples. Many unit tests included. Legal notice/Impressum: Klaus Meffert An der Struth 25 D-65510 Idstein sourceforge <at> klausmeffert.de
An OpenSource Least-Squares-Adjustment Tool
JAG3D is no longer developed at source-forge, and has moved to GitHub. Please visit https://github.com/loesler/applied-geodesy or https://software.applied-geodesy.org to get the latest version.
Cutting Problem solved by Genetic algorithms. The goal is to cut a rectangular plate of material into more smaller rectangles. The cuts must be rectangular and guillotinable.
OW.NET -- 1-Wire API port from Java (and J#) to C#. Use the Dallas 1-Wire and iButton chips with standard C# using a serial adapter (also CF.net) or the TMEX drivers on the Windows platform. No J# distribution installation required.
This site hosts the source code for C++ version of the Broker for SBW, NOM module, advanced simulation suite, analysis applications and model editors.
NaruGo is game AI project. Current targets are GO board game and Texas Holdem poker. It investigates Genetic programming to build game AI logic. Also EA/GP simulations for TSP, Graph layout and Prisoners Dilemma problem.
GEP is an evolutionary algorithm for function finding. This framework is a powerful way of expressing and coding genetic-like structures and quickly finding solutions through evolution by common genetic operators.
用c实现了常用的容器，如果rbtree,hashtable,list,vector,deque,heap,map,以及定时器，os api，应用开发框架。 实现了一个基于btree索引算法的文件数据库,提供了断电保护,以及事务提交与回滚等接口
an simple thread pool in linux, based on POSIX thread API. Management thread will retrieve needless idle thread to keep in low resource consumption.
An interactive binary search tree. The user may interact with the tree by performing rotations, balancing, insertions, and deletions. For educational purposes
uCOS-III porting for STM32F2xx (STM322xG-EVAL)
Formicidae is the official simulator and visualizer for the Ant-Wars competitive programming site, written in Java and SISC. The site is hosted at www.ant-wars.net.
An attempt to design minimum cost broadband networks with the use of a modified version of the Particle Swarm Optimization method. A GIS subsystem is used for the visualization of data and results.
Very useful framework library, contains many frequent used code snippets, algorithms, data structures, WinForms & APS.NET controls for all-day work.
This is a cross-platform framework for using Genetic Algorithms for solutions. Written in Java and uses convinient plug-in features for every phase in the genetic development, while maintaining an easy-to-use API for easy integration into applications.
GFP use Genetic Programming and LISP-like language for growing program.
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.
JCLEC is a general purpose evolutionary computation framework developed in Java. Some of its mains features are: multilevel architecture, highly reusable and integrable with other systems, easy to use and a lot of implemented algorithms and operation
Logi (Local Observations to Global Integration) transforms several local coordinate systems (composed of polar measurements) into a global spatial uniform network with respect to the Guide to the Expression of Uncertainty in Measurement (GUM).
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.
Utility converts the weights file of a MLP Breadboard into a formula
The NeuroSolutions: Formula Generator utility converts the weights file of a default MLP breadboard (1-hidden layer with a TanhAxon in the hidden layer and either a TanhAxon or BiasAxon in the output layer) into a usable formula that can be copied and pasted into your own programs to compute the output of the trained neural network.
AAARF, written in PERL and with numerous adjustable parameters, identifies sequence overlaps in small shotgun sequence datasets and walks them out to create long pseudomolecules representing the most abundant repeats in a genome.
This project is aimed at creating a set of highly universal AI tools to be used in AI modelling. So far the subject area includes: Neural Networks, Fuzzy Logic, Biological Methods, Genetic Computing. New tools will be devised as the project goes on.
A tool that helps develope the course of cognitive thought processes through software. This tool will look at the raw hex code of any input. It establishes pattern recognition over a mesured time incrament that in itself is at a different pace.
Project offers alternate solutions to the performance problems developers are facing on x86 and x64 architectures. The library covers searching and sorting, mathematic routines, and substitutions of commonly used standard library routines.