Open Source Java Algorithms - Page 5

This project is a highly flexible implementation of the well known bin packing algortihms: next fit, first fit, best fit, worst fit. The elements and bins may have any number of dimensions.

This is a Java-based project for complex event extraction from text and co-reference resolution. Currently the code can read BioNLP shared task format (http://2011.bionlp-st.org/) and i2b2 Natural Language Processing for Clinical Data shared task format (https://www.i2b2.org/NLP/DataSets/Main.php). Event extraction includes finding events and the parameters for an event in a text. The method is based on SVM but other ML algorithms can be adopted. The method details are explained in the following paper: Ehsan Emadzadeh, Azadeh Nikfarjam, and Graciela Gonzalez. 2011. Double Layered Learning for Biological Event Extraction from Text. In Proceedings of the BioNLP 2011 Workshop Companion Volume for Shared Task, Portland, Oregon, June. Association for Computational Linguistic

It moves by itself inside networks like virus infection & plagues, it is being written to solve computer virus problem drastically and responsibly. It is legal, free and open for public domain to improve W3 ICT Security.

Blubber system is an Eclipse RCP application for distributed systems modeling. Designed for university researches and inlcudes: task graph editor; graph transformation tools; graph modelling on distributed system; real-time modelling on GerdaFramework.

Bricks4J is a set of common tools, utils and classes for Java, aiming to ease development for a widespread kind of tasks.

The mathematical morphology have different applications on Image processing, it represent one processing non lineal sample. We show the CIDEFORM software as result of all mathematical morphology techniques.

A Color Management System library implement by Java language.

CRUSH is a pioneering reduction and imaging suite for many astronomical cameras operating at far-infrared, submillimeter and millimeter wavelengths, such as SHARC-2, SCUBA-2, LABOCA, GISMO, or SOFIA/HAWC+ (to name a few).

CSGraph is a simple graph library. It provides the most popular algorithms to create and manipulate graphs.

Calamari is a collection of Java APIs for implementing genetic algorithms, neural networks, and vehicle simulation. It is still being designed and developed.

The Catalsyt Framework is a refinement on the MVC framework. It provides greater focus on user business workflow rather than application workflow. It's goal is to enable business analysis and developers to work closer.

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.

It consists of a library of Java classes that gives us support the programming of applications. Boring, repetitive tasks will be included in CommunityUtil. So this is the aim: to provide fast that encapsulates all classes complicated tasks.

Automatic Solver for Railway-related conflicts

Conrad is both a high performance Conditional Random Field engine which can be applied to a variety of machine learning problems and a specific set of models for gene prediction using semi-Markov CRFs.

Creating an automated 3D enviroment for the transport of containers. This will be done by using a server-client method. The project goal is to create a fast algorithm.

Control logic Java package is a set of Java classes aimed at: - Implementation of a real-time PC-based control - Simulation of control systems Setting up a control system involves working with so-called triggers. See project Wiki for detailed information and examples.

The Customizable Caching Framework provides a basic but robust implementation of a cache with expiry and memory management features. It also provides entry points to populate the cache, making it reusable in several applications.

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.

DIProxy is integrated some DIContainer. And DIProxy reject relation between WebFramework and DIContainer. added DIProxy is implemented Dynamic injection. see at http://diproxy.wiki.sourceforge.net/

A light-weight group communication system/library of distributed algorithms implementations for agreement problems (e.g., Consensus, Unreliable Leader Election and Atomic Broadcast).

This is an implementation of Donald Knuth's Algorithm X ("dancing links"). This is primarily a sudoku generator and solver, though it can be used to solve other exact cover problems.

Very fast and easy to use Java tool for solving and generating Sudoku puzzles. By using Donald Knuths exact cover algorithmus it can not only solve or create the usual 9x9 but also 4x4, 16x16 or even bigger Sudokus in a very efficient way.

This chess program changes its strength to give the best match against you. Eventually it learns to beat you specifically through learning alogirthms. Features included transposition tables and a elementary 3-piece endgame tablebase.

This project is an extended implementation of Knuth's "Dancing Links" algorithm and some use cases (e.g. Sudoku).