Open Source Java Algorithms for BSD - Page 3

Fully playable Java game demo illustrating basic game programming technics, such as sprite animation, pixmap fonts, time or frame related game loop, affine transformations, convolution filters, sound generation and playback...

a sandbox for trying my engine ideas

Java implementation of A* algorithm, that could be used in Roguelike games.

Aggressive Rectangle Truncation (ART) with Location Verfication Mechanism is a localization algorithm in wireless sensor networks written in nesC.

A Java implementation of a cubic B-spline curve smoothing function. Allows an arbitary number of points with a variable number of dimensions to have a cubic B-spline curve "fitted". Useful in finance for analysing bond or swap yield and discount curves.

Aleph is both a multi-platform machine learning framework aimed at simplicity and performance, and a library of selected state-of-the-art algorithms.

The Gene Expression Programming Framework in Java. It separates the process of evolution from the process of interpretation of the chromosome, allowing the use of various schemes in the chromosome.

The subgraph matching problem (subgraph isomorphism) is NP-complete. Previously, we designed an exact subgraph matching (ESM) algorithm for dependency graphs using a backtracking approach (http://esmalgorithm.sourceforge.net). We further designed an approximate subgraph matching (ASM) algorithm that is capable of detecting approximate subgraph matching based on a subgraph distance. Assume that the graph G and the subgraph Gs have m and n vertices, and km and kn edges respectively, the total worst-case algorithm complexity is O(m^n * n(n-1)/2 * km * log m). This Java implementation implements our ASM algorithm. See README file: https://sourceforge.net/projects/asmalgorithm/files/ If you use our ASM implementation to support academic research, please cite the following paper: Haibin Liu, Lawrence Hunter, Vlado Keselj, and Karin Verspoor. Approximate Subgraph Matching-based Literature Mining for Biomedical Events and Relations. PLOS ONE, 8:4 e60954, 2013.

Toolbox for Java developers. Includes right now only a multi-layered extensible cache system but will grow depending on requirements.

Awakener aims to provide a Java library for solving practical, real world optimisation problems by means of genetic algorithms (turnkey algorithms for >= 90% of industry problems). Awakener extends Sleepwalker with specific algorithms.

A paint program where the canvas is the visual cortex of a simple kind of artificial intelligence. You paint with the mouse into its dreams and it responds by changing what you painted gradually. There will also be an API for using it with other programs as a general high-dimensional space. Each pixel's brightness is its own dimension. Bayesian nodes have exactly 3 childs because that is all thats needed to do NAND in a fuzzy way as Bayes' Rule which is NAND at certain extremes. NAND can be used to create any logical system. In this early version, I'm still working on edge detection and its understanding of the same shapes at different brightnesses. This will be a module of the bigger Human AI Net project and will be used for adding realtime intuitive high dimensional intelligence in audio and visual interactions with the user.

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.

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.

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.

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.

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.

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.