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.
Regexp testing tool allows to apply group of regexps to huge arrays of data (millions or so) in order to investigate search or search/replacement possibilities of regexp group.
JoSQL (Java Objects SQL) provides SQL capabilities for querying, ordering and grouping of collections of Java objects (POJOs). It allows a SQL statement to be applied to the collection of objects and the matching set returned, ordered and grouped.
Generate interest, access liquidity without selling, and execute trades seamlessly. All in one platform.
Geographic restrictions, eligibility, and terms apply.
Don't hard-code data-structures for Artificial Intelligence (AI). 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.
Java classes that enable definition of new Charsets based on other existing Charsets, without additional programming. Includes a character set with Kamenik encoding.
Classroom allocation using Genetic Algorithms and restricted mutation. Developed by AIGroup: Pablo Cababie, Facundo Cancelo, Alvaro Zweig y Gabriel Barrera
Tpl makes it easy to serialize your C data using just a handful of API functions. The data is stored in its native binary form for maximum efficiency. C, Perl and XML supported. Data is portable across CPU types and OS's from Unix to Mac to Windows.
A log player for "The Fourth Coming" ("T4C", http://www.the4thcoming.com).
Given a log-file, this tool will replay a T4C game you've played before.
It will have built-in functionnalities like : merging log files
together, searching and cleaning
ACMgen is an automatic code generator of Asynchronous Communications Mechanisms based on the generation of Petri nets models that can be formally verified against some properties and then transformed into a real implementation (e.g. C++ or Verilog).
Framework: Project for Evolutionary Predator Prey Algorithms, used to implement an evolutionary scheme based on the developement by van Laumanns. Implement testproblems, special behaviours, environments, and other yet not known features.
Combean is a Java framework for mathematical structures and optimization algorithms. Through a set of Java interfaces and JavaBeans-based config, Combean glues optimization codes together - leading to more interoperable, adaptable and flexible solutions.
The Open Optimization for Java provides a framework and the implementation of commonly-used algorithms found in Graph Theory and Network Optimization, e.g. shortest path and postman problem.
Application provide indexing and searching capability using Inverted File & TVSM methods. Also provide native integration with UNIX based indexing service also GoogleBase & YouTube search via Atom feeds.
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.
An easy to extend, highly graphical, easy to use 2D robot simulator specialized for path planning algorithms. Can be used in testing various robotic algorithms, and already used for comparison of path planning algorithms like RRT, RRTConnect, PRM, RboT..
Theba is a plugin-based image analysis framework for segmentation of and measurements on 3D and 2D images. Theba has a nice GUI that allows inspection and manipulation of the image and a wide range of plugins including segmentation.
FastAOP is an very high performant AOP (Aspect Oriented Programming) framework for java. The framework was initially
developped to support performance profiling and monitoring for large J2EE applications with nearly no runntime overhad.
Announcement: jp-mobile and fastAOP will go mobile, please visit jp-mobile (GWT based) website at: http://code.google.com/p/jp-mobile/
An academic project where computer-science students can practice data structures principles. Based on the famous problem of the labyrinth rat, this application has an engine where you can run your own algorithms to help the robot to get out of the laby.
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.
Depending on a SICK lasescan and a created environment landscape a routing function will be implemented to give a robot a few waypoint to drive from a start point to a choosen destination.
Design and develop Recommendation and Adaptive Prediction Engines to address eCommerce opportunities. Build a portfolio of engines by creating and porting algorithms from multiple disciplines to a usable form. Try to solve NetFlix and other challenges.