Open Source Java Algorithms for BSD - Page 5

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.

This project aims to provide developers a convenient library about graph theory algorithm and some basic data structures. It will be developed in Java via Eclipse IDE, supporting both win32 and linux systems, and published as jar files.

HL7 to XML Transformation toolkit. Using HL7 v2 XML

Open Source IM and voice client using Jabber and SIP protocols, with great audio quality thanks to speex and a nice and clean interface. Programmed in Java and C++. It supports chat, voice and file transfers.

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.

Das Horner-Schema ist ein schnelles und einfaches Verfahren, um einen Funktionswert von Polynomen an einem gegeben Wert zu berechnen. Dieses Projekt beinhält eine Facharbeit und Programmierbeispiele in Pascal und Java zum Thema.

Information Dispersal Algorithym (IDA) is a method to split a file f into n pieces in such a way that the file can be reconstructed from some predefined subsets of pieces. this is a Java implementation.

Institute of Technology, Blanchardstown Computer Science code by the class of 2007-2011 on course BN104. In this project we are open sourcing all of our project work to the public in the hopes it can be reused, built-upon, and used in education.

Java generic API for search algorithms on graphs implicitly given by tree node expansion operator

This is a series of *.java Classes for making programming tasks simpler, much like Apache Commons. Included in this src package is an Advanced Randomizer, TStringList Clone From Delphi, an Algorithem Class, and Method MultiTask Better than Runnables.

Discontinued.

JBernstein is a tool implemented in Java that enables to check whether a polynomial constraint holds for all variables within their domain. It is mainly used in the verification or synthesis of cyber-physical systems where the system model is nonlinear. The tool also supports specifications in assume-guarantee style. The underlying algorithm is based on a translation to Bernstein polynomials, and several optimization techniques are implemented to ensure efficiency. Concerning performance, the tool enables to check all examples in the PVS Bernstein testsuite within a second, which can be an order of magnitude faster than some other tools such as QEPCAD or REDLOG. Although JBernstein uses double, it offers automatic error-estimation capabilities (experimental) so that the generated result is correct (the solver may return unknown when the error-estimate is too large)

JBooleanExpression is a simple Java API to evaluate a Boolean String Expression like "!true&&false||true" (parse a Boolean String Expression to a boolean primitive type)

The K.U.Leuven JCHR System is an integration of Constraint Handling Rules (CHR) and Java designed with three aims in mind: user-friendliness, flexibility and efficiency. http://www.cs.kuleuven.be/~petervw/JCHR/

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

JClassCollections is a library of Java collections whose contents can be filtered by class. When a filtered view is requested, all objects that are instances of the specified class (either directly or via inheritance) are included.

JCortex is a complete solution that allows software developers create, educate and use Artificial Neural Networks in Java projects. Splits in two elements: JCortex Framework, an ANN Java framework; and JCortexBuilder, its graphic development environment.

A Graph support extension to the java.util collections framework.

A java framework for developing meta-heuristics that supports the use of grids environments. The meta-heuristics planned to be realeased are GAs, VNS and NNs. The grid middleware that will be firstly explored is the OurGrid solution.

The project models a Matrix in JAVA with a complete Object Oriented approach, from its values to its access and indices. There are specialized classes for tables(2), cubes(3), and arbitrary(N) dimensions matrices

JMill is the java-based game of "Nine Men's Morris". This project is son of the greater parent SourceForge project "JGames", that realizes the real game environment...

Common classes for the Ballistic software

Common classes to perform mathematical operations

JOthi is the java-based game of "Othello". This project is son of the greater parent SourceForge project "JGames", that realizes the real game environment: JOthi only defines the "Othello" game rules and its specific AI players.