Evolutionary Computation on Android
This project is a prototype of evolutionary computation algorithms implementations for Android. We, Tom BERNARD and Ugo PICHE, were asked to do this project as part of our electronic & computer science in the Polytech'Paris-UPMC engineer school, in France. We wanted to thank Mario Zechner and all contributors behind the fabulous libGDX project (https://code.google.com/p/libgdx/) which allowed us to use Box2D and OpenGL ES more, more easily than without this API.
java library for heuristic optimization algorithms.
FunctionalJ is a library which makes it easy to use functional programming patterns in Java, such as representing functions as objects, partial function application, higher-order functions, mapping, folding, and more.
A histogram library for Java that accepts large datasets with any distribution or range with a very small memory footprint, needs no pre- or post-processing, and provides several statistical functions.
Image Processing is a Java project that implements many of the image processing algorithms available.
[frozen] A library for computing cycles in graphs or in Java code.
[This project is frozen, but has an offspring with more features: https://github.com/jeffhain/jadecy ] JCycles provides treatments to compute cycles, or just strongly connected components, in directed graphs in general, or in classes or packages dependencies graphs parsed from class files (major version <= 51, else does best effort). It uses Tarjan's algorithm for SCCs, and Johnson's for cycles, with continuations instead of recursion, which allows to handle large graphs (< Integer.MAX_VALUE vertices). Requires Java 5 or later.
The Java Data Processing Framework (JDPF) helps you in the definition, generation and execution of standard and custom data processing procedures.
JPar2 is a 100% pure java (1.5+) implementation of the PAR2 specification.
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.
Fast and more random implementations of java.util.Random.
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.
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
JFEP is a Java fast mathematical expression parser and evaluator. It is designed to avoid inefficiency and to support multiple evaluations without overhead.
Utility classes, APIs and tools for Java
A set of helper and utility classes, APIs and tools for the Java Programming Language. For more details - pleas visit the project homepage.
K-automaton is a new parsing (syntactic analysis) machine isomorphous to language. Implemented in Java. Can generate Java code from grammars described in EBNF.
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).
niPRO AnalyzerTask to calculate link popularity
AnalyzerTask to calculate the link popularity (SIN LP) for ContentObjects integrated into the iQser GinServer. Developed by niPRO-Project.
A Map (or HashTable) for Java that is backed by the filesystem to provide unbounded size. Additionally, MegaMaps may remain on disk between VM invocations, providing persistent hashtables.
My projects must need open source.
Programa per trobar el numero més petit.
Operations Research EXperiment Framework for Java
A P2P overlay construction toolkit, which supports routing algorithm researchers in addition to application developers. It provides multiple routing (DHT) algorithms such as Chord, Kademlia, Koorde, Pastry and Tapestry, and a distributed environment emu