Open Source Java Algorithms - Page 9

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

JNSGA2 is a Java library with an implementation of the multi-objective genetic algorithm NSGA-II published by Deb et al.

Common classes for the Ballistic software

Common classes to perform mathematical operations

JNdiff: An Optimized Alghorithm for Natural (XML) Diff-ing

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.

JPortForwarder Project JPortForwarder is a multithreaded TCP Port Forwarder application. The following feature have been developed: - Generic TCP Port Forwarging. Listen for a port and forward to an ip:port. - Multihoming TCP Port Forwarding.

JS-Sorting-Algorithm is an educational repository and GitBook-style resource about classic sorting algorithms. It explains sorting as a core topic in data structures and algorithms, with attention to internal sorting, external sorting, time complexity, memory usage, and stability. The guide covers ten major sorting methods, including bubble sort, selection sort, insertion sort, shell sort, merge sort, quicksort, heap sort, counting sort, bucket sort, and radix sort. It compares algorithms by complexity classes such as quadratic time, linearithmic time, and linear time. The repository also includes terminology explanations for concepts like data size, buckets, in-place sorting, out-place sorting, and stability. Overall, it is a compact reference for students and developers who want to review sorting theory and implementation examples.

Application provide indexing and searching capability using Inverted File & TVSM methods. Also provide native integration with UNIX based indexing service also GoogleBase & YouTube search via Atom feeds.

JSort is a library with some sorting algorithms implementation and related data structure. It has compare-based algorithms, linear sorting, graph sorting, priority based queue, and so on.

The JSparse Matrix Package, developed by Philipp Geigenmüller during an internship at the prudsys AG in Chemnitz, Germany, is an extension of the well-known Java Matrix Package (JAMA) and allows the use of sparse matrices and related algorithms.

Currently, all existing formal tools are designed to serve as formal verifiers, using one implementation or another. JTLV is a new tool aimed to facilitate and provide a unified framework to the development of formal verification algorithms.

JXmlSql is a Java database API ( MySql, Oracle, Access )that eliminates JDBC code. JXmlSql allows developers to define application and prepopulation SQL statements inside xml files. Options for query, insert, update, delete, report and prepopulation SQL.

JaNaG is a Java random name generator for role-games, authors, and the like. It is based on a name fragment database that creates relatively reasonably sounding names. It can run as applet, GUI appliance, command line tool, or on a server-client basis.

Jafaran (Java Fast Random) provides fast, and for some more random, implementations of java.util.Random, with additional nextXXX() methods, and methods to retrieve and restore state. The names of implementations contain "Conc" (for concurrent) if they are thread-safe and non-blocking, or "Seq" (for sequential) if they are not thread-safe. Also provides an implementation of Ziggurat algorithm (based on J. A. Doornik paper, 2005), used by nextGaussian() methods of the provided implementations. Requires Java 5 or later. Also available on github since 2015/12/13: https://github.com/jeffhain/jafaran Principal classes: - Implementations using Mersenne-Twister algorithm (good pseudo-randomness): MTSyncRNG MTSeqRNG - Implementations using Marsaglia Xor-Shift (fast): MXSIntSeqRNG (32 bits) MXSLongSeqRNG (64 bits) (nextLong() faster, larger period) - Ziggurat: Random-based implementation of Ziggurat algorithm.

Java 3D VR with basic headtracking. Basics of blob tracking, image processing. Make sure you have a webcam and an infrared led

The JAccumulator package brings the convenient type conversion and ad hoc composition capabilities of Javascript to Java programming structures. JAccumulator is dependent upon the Jupperware (http://jupperware.sf.net) to provide Javascript-like associative list capabilities and the convenience of easy hierarchical construction.

A library to build and manipulate finite state automata, I/O automata, transducers and rational langagues in Java.

The Java Boolean Expression Library (JBEL) enhances the Java Collections API by implementing on-the-fly sorting, filtering and reasoning capabilities including, select(), collect(), reject(), detect(), doForEach() using functional programming techniques.

The core of an extensible cellular system that serves as the basis for an entirely new, modular application framework

Java classes that enable definition of new Charsets based on other existing Charsets, without additional programming. Includes a character set with Kamenik encoding.

An STL-like Java collections library.

Java Combinatorial Optimization Platform is used to solve combinatorial problems using common interface, providing means to easily add new algorithms and problems and to benchmark them.

A Java based, pMars compatible, CoreWars simulator with Genetic Algorithm warrior evolver functionality. Java 8 is needed. See [Wiki:Tutorial]

JFEP is a Java fast mathematical expression parser and evaluator. It is designed to avoid inefficiency and to support multiple evaluations without overhead.