Open-Source Framework for Distributed Constraint Optimization (DCOP)
FRODO is a Java platform to solve Distributed Constraint Satisfaction Problems (DisCSPs) and Optimization Problems (DCOPs). It provides implementations for a variety of algorithms, including DPOP (and its variants), ADOPT, SynchBB, DSA...
The source code has been migrated and is now hosted on Github: https://github.com/jenetics/jenetics Jenetics is an advanced Genetic Algorithm, Evolutionary Algorithm and Genetic Programming library, respectively, written in modern day Java. It is designed with a clear separation of the several algorithm concepts, e. g. Gene, Chromosome, Genotype, Phenotype, Population and fitness Function. Jenetics allows you to minimize or maximize the given fitness function without tweaking it. In contrast to other GA implementations, the library uses the concept of an evolution stream (EvolutionStream) for executing the evolution steps. Since the EvolutionStream implements the Java Stream interface, it works smoothly with the rest of the Java Stream API. Other repositories: - https://github.com/jenetics/jenetics Maven: - http://search.maven.org/#search|ga|1|a%3A%22j
An OpenSource Least-Squares-Adjustment Tool
JAG3D is a simple tool to estimate geodetic 1d, 2d and 3d-networks by a least-squares-adjustment called Gauß-Markov model. For gross-error detection, the software supports common outliers tests (based on hypothesis testing) and robust L1 norm (BIBER estimator). Moreover, the software supports deformation-analysis on the observation level. This network adjustment application supports classic observations: - Distances 2D/3D, - Directions and/or azimuths, - Zenith angles, - Levelling difference as well as - GNSS-baselines 1D, 2D and 3D. Further feature (add-ons): - Coordinate-transformation (CoordTrans), - Form analyser (FormFittingToolbox), - Datum-transformation (UTM, Gauß-Krüger, Soldner; WGS84, Bessel, Krassowski, Hayford; NTv2 ...)
Data reduction and imaging for select astronomical cameras
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).
Big Data Stream Analytics Framework.
A framework for learning from a continuous supply of examples, a data stream. Includes classification, regression, clustering, outlier detection and recommender systems. Related to the WEKA project, also written in Java, while scaling to adaptive large scale machine learning.
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
Mathematics, linear algebra and optimisation
oj! Algorithms - ojAlgo - is Open Source Java code that has to do with mathematics, linear algebra and optimisation; particularly (but certainly not exclusively) suitable for the financial domain.
jChecs is an open source Java chess program, designed to introduce the basics of computer chess programming concepts.
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
Jasypt (Java Simplified Encryption) is a java library which allows the developer to add basic encryption capabilities to his/her projects with minimum effort, and without the need of having deep knowledge on how cryptography works.
Constraint Satisfaction Problem solving library for Java
Easy CSP is an open-source Java library designed for Object-based Constraint Satisfaction Problem solving. Object-based CSPs need not to have an int-based representation.
This project is a reasoner for the description logic EL+. It computes the concept subsumption hierarchy. It is an OWL 2 EL reasoner.
GeneThello (read jə-ˈne-ˈthe-lō), is an acronym for genetic othello, an othello (reversi) playing program which based on Genetic Algorithm (GA). In principle GeneThello consist of an othello program and a genetic algorithm system.
NEW OPTIMIZATION TECHNOLOGY & PLANNING EXPERIMENT. Technology is designed for multidimensional optimization practical problems with continuous object functions. Technology higher efficiency than traditional optimization methods.
Password Safe encrypted databases, Java library
Java module to create, read and write Password Safe V3 encrypted databases. The package is a mature offspring from project JPasswords and can be used with Java 1.6 or later.
Fills a rectangle using given tetris shapes
Fills a rectangle using given tetris shapes (tetraminos) using an optimized brute force algorithm. A puzzle can have many different solutions; this solver will stop at the first one. Not all puzzles are solveable. Created to solve the annoying tetris puzzles in The Talos Principle and Sigils of Elohim.
Lascer liefert zu einer Menge binär klassifizierter Attribut-Vektoren eine Menge von Regeln zur Beschreibung der Klassen. Die Regeln können auch mathematische Funktionen enthalten, deren Art vorgegeben werden kann.
An open source workbench for chemo- and bioinformatics built on the Eclipse Rich Client Platform (RCP).
Open Source Java platform for Optimization, DoE, and Learning.
OpenDino is an open source Java platform for optimization, design of experiment and learning. It provides a graphical user interface (GUI) and a platform which simplifies integration of new algorithms as "Modules". Implemented Modules Evolutionary Algorithms: - CMA-ES - (1+1)-ES - Differential Evolution Deterministic optimization algorithm: - SIMPLEX Learning: - a simple Artificial Neural Net Optimization problems: - test functions - interface for executing other programs (solvers) - parallel execution of problems - distributed execution of problems via socket connection between computers Others: - data storage - data analyser and viewer
A collection of Concurrent and Highly Scalable Utilities. These are intended as direct replacements for the java.util.* or java.util.concurrent.* collections but with better performance when many CPUs are using the collection concurrently.
OpenNeuron is a neural networks implementation written in Java. Currently supports only Kohonen Network model, but API is designed to be easily extended to model other network types. This implementation was used for face thermal pictures recognition.
SpotSigs is a novel engine for near-duplicate document detection in large Web collections originally developed at the Stanford InfoLab.
This is a framework written in Java for processing a diversity of algorithms in the fields of graph theory, genetic algorithms, sorting algorithms and others.
A collection API extending the Java Collections API. Currently it is providing a trie map (java.util.Map) and a trie set (java.util.Set).
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.