Open Source Java Algorithms - Page 3

Java Machine Learning Library is a library of machine learning algorithms and related datasets. Machine learning techniques include: clustering, classification, feature selection, regression, data pre-processing, ensemble learning, voting, ...

This program benchmarks the following sorting algorithms implemented in Java: Quick Sort, Heap Sort, Merge Sort, Selection Sort, and Bubble Sort. A command line GUI was created to facilitate all your benchmark needs.

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.

LIBrería de Grafos de Simple manejo, escrita en Java y 100% en español, posee una extena docuementación

La librería Arduino para Java es una compilación de métodos que permite comunicar aplicaciones en Java con Arduino

TER implements the CCSDS Recommendation for Image Data Compression (CCSDS 122.0-B-1). TER also adds new features to the Recommendation. TER is designed and programmed with the aim to provide a good basis to test and develop the CCSDS Recommendation.

Track your friends in real time on a map.. and many more features

YABI93 is an Interpreter for the esoteric programming language Befunge, version "Befunge93". It is written in Java 1.5 and uses Swing for its graphical interface. YABI supports a multilanguage GUI.

jpaul is a Java implementation of several algorithms widely used in program analysis. It emphasizes flexibility and ease-of-use and is independent of any specific compiler infrastructure project. BSD Licence.

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.

Simple source .java file; .bat for fast re-compile and run; and pre-compiled .jar Java program with example from scratch writed in Notepad++ without Eclipse, etc., How to draw and rotate 3D box most simple way. Rotation speed regulated in simple Loop with 10 ms sleep. Use Java version 8 (OpenJDK 8, OracleJDK 8, OracleJRE 8, ..). Higher versions have an anti-aliasing error in the BufferedImage ( Windows 10 ). Python version with tkinter and math imports. Including calculated faces, moving lights and shadows only with CPU.

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 framework library with a template method interface and inheritable classes for an executable process design which produces an executable which is both a GUI and a console application. It provides multi-threading for work items of the provider process .

a sandbox for trying my engine ideas

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

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).

ADiV is a set of components for LAMW that uses JAVA and Pascal. It stands out for the simplicity of programming, thanks to the use of Pascal and hiding the Java Android code.

All pairs shortest path implementation using iterative mapreduce paradigm. Specifically, the iterative paradigm is an implementation of Twister (www.iterativemapreduce.org), developed by Indiana University.

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.

Agenda desenvolvida em Java, utilizando banco PostGreSQL. Itens: Cadastro de Contatos Cadastro de Tarefas

AhoCorasickDoubleArrayTrie is a Java implementation of the Aho–Corasick multi-pattern matching algorithm that is optimized using a Double-Array Trie data structure. It is designed for fast keyword scanning across large texts, where you want to search for many patterns simultaneously and efficiently. The core idea is to build an automaton from a dictionary of patterns, then stream through input text to emit matches with minimal overhead. By using a double-array trie representation, the project emphasizes performance and memory efficiency compared to simpler pointer-heavy trie structures, which can matter a lot for large dictionaries or latency-sensitive services. This makes it a strong fit for tasks like content filtering, entity/term spotting, dictionary-based annotation, or high-throughput log/text processing. In short, it’s a specialized, speed-focused library for industrial-strength multi-keyword matching in Java.

Alef++, is a new programming language like Perl and Lisp syntax, with a many changing in classical languages designs, her specification designed to be implemented for any VM, by default can access to any private/protected/default Java fields or methods.

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

AlgART Java libraries for processing arrays and matrices are open-source product, distributed under MIT license. So, anyone can use them for free without any restrictions. Main features: 63-bit addressing of array elements (64-bit long int indexes), memory model concept (allowing storing data in different schemes from RAM to mapped disk files), wide usage of lazy evaluations, built-in multithreading optimization for multi-core processors, wide set of image processing algorithms over matrices, etc. - please see at the site. Almost all classes and methods are thoroughly documented via JavaDoc (you may read full JavaDoc at the site).