With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.
You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
Try free now
AI-powered service management for IT and enterprise teams
Enterprise-grade ITSM, for every business
Give your IT, operations, and business teams the ability to deliver exceptional services—without the complexity. Maximize operational efficiency with refreshingly simple, AI-powered Freshservice.
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.
Geom4J is a computational geometry library for Java. It contains implementation of the most important computational geometry data structures and algorithms coded in pure Java, designed for ease of use and optimized for performance.
http://jocdelavida.piposerver.com - Online implementation of Conway's Game of the Life 0 players game, but using entities based on the nature, like animals or plants who born, grow up, reproduces breed and die. Written in Java 6 and Adobe Flex 3.
Unfixed bugs delaying your launch? Test with real users globally – check it out for free, results in days.
Testeum connects your software, app, or website to a worldwide network of testers, delivering detailed feedback in under 48 hours. Ensure functionality and refine UX on real devices, all at a fraction of traditional costs. Trusted by startups and enterprises alike, our platform streamlines quality assurance with actionable insights.
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.
plausj a collection of checksum algorithms used to validate business keys like bank account codes or credit card numbers. It's compiled as JVM bytecode files (although it's not necessarily implemented in Java) and can be used on JRE 1.5 and later.
Neural Network class library: Its a C/C++ implementation that provides following three neural architecture - Feed-forward network, Radial Basis function network, multi-layer perceptron and Self-Organizing Maps.
Implementation of Damerau-Levenshtein fuzzy string matching in Java. Returns the distance adding one point per character insert, deletion, mismatche and swap.. This is an extension of apache/commons/lang/StringUtils.getLevenshteinDistance()
Fuzzy numbers and basic fuzzy arithmetics (+, -, *, /, 1/x) implementation written in Java. Should be used as a library, but it also has a GUI which demonstrates its capabilities (using SWT widgets).
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.
A Java package for pretty-printing a text by deciding where to introduce line-breaks and indentation. A Javaimplementation of Derek Oppen\'s pretty printing algorithm. It is _not_ a pretty printer for Java code, though it could be used to write one.
An implementation of "k-Way Merging" as described in "Fundamentals of Data Structures" by Horowitz/Sahni. NOTE: This project has been moved to http://code.google.com/p/kway/
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).
This is an implementation of Donald Knuth's Algorithm X ("dancing links"). This is primarily a sudoku generator and solver, though it can be used to solve other exact cover problems.
ANT is a lightweight implementation in C of a kind of artificial neural net called Multilayer Perceptron, which uses the backpropagation algorithm as learning method. The package includes an introductory example to start using artificial neural nets.
The Open Optimization for Java provides a framework and the implementation of commonly-used algorithms found in Graph Theory and Network Optimization, e.g. shortest path and postman problem.
JKalman is an Open Source Javaimplementation of Kalman filter.
Kalman filter is an efficient computational (recursive) tool to estimate the dynamic state of a process in a way that minimizes the mean of error.
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.
This project is a highly flexible implementation of the well known bin packing algortihms: next fit, first fit, best fit, worst fit. The elements and bins may have any number of dimensions.
General purpose state observation library for Plan Old Java Objects. It enforces Model-View-Controller paradigm, has well defined API and set of ready made implementation algorithms.
Project Tokaf is an general implementation of top-k algorithm. It provides interfaces for all modules that are needed. It also features user preferences module, for computing new preferences and manipulating existing ones.