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.
We propose a metabolic pathway drawing algorithm for reducing the number of edge crossings by considering the fact that metabolic pathway graph is scale-free network.
MCS is a tool that exploits the Monte Carlo method and, with a complex algorithm based on the PERT (Program Evaluation and Review Technique), it estimates a project's time.
MCS is a opensource project and it was devolped by Java Programming Language.
The goal: to provide implementations of as many algorithms (sorting, searching, ...) and data structures (lists, trees, ...) as possible, accompanied by discussion of big O run time and memory limits and references to sources of further study.
This chess program changes its strength to give the best match against you. Eventually it learns to beat you specifically through learning alogirthms. Features included transposition tables and a elementary 3-piece endgame tablebase.
Lay a foundation for success with Tested Reference Architectures developed by Fortinet’s experts. Learn more in this white paper.
Moving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
G.A.V. (Graph Algorithm Visualizer) is a tool that visualizes algorithms from graph theory. A step-by-step visualization from each different algorithm allows the user to understand the particular algorithm very easily.
Java API for implementing any kind of GeneticAlgorithm and Genetic Programming applications quickly and easily. Contains a wide range of ready-to-use GA and GP algorithms and operators to be plugged-in or extended. Includes Tutorials and Examples.
EMURA is a suite of Java applications that allows two users to send encrypted messages back and forth - as a chat. The encryption key is secure and generated using the Diffie-Hellman algorithm. Utilizes GNU-CRYPTO libraries
Shape is a molecular conformation prediction program. It uses a geneticalgorithm to efficiently search the conformational space of a biomolecule and then clusters the results. It is very simple to use.
A Java package for pretty-printing a text by deciding where to introduce line-breaks and indentation. A Java implementation of Derek Oppen\'s pretty printing algorithm. It is _not_ a pretty printer for Java code, though it could be used to write one.
Picsart Enterprise Background Removal API for Stunning eCommerce Visuals
Instantly remove the background from your images in just one click.
With our Remove Background API tool, you can access the transformative capabilities of automation , which will allow you to turn any photo asset into compelling product imagery. With elevated visuals quality on your digital platforms, you can captivate your audience, and therefore achieve higher engagement and sales.
The implementation of Bee Hive @ Work algorithm that simulates the foraging behavior of honey bees in nature. The aim is to provide an extensible framework that can be used by researchers to simply create new applications of this algorithm.
MelodyBall generates a simulated array of soundmaking bars, on which a ball bounces and plays a melody (see www.melodyball.com). Need to fix Java/MIDI bugs and read MIDI files as source data for the algorithm to create alternate melodies.
a first work algorithm trials to implement a compromise between distributed and centralized version control system.part of research project,it's only a simulation. no real networking is implemented ,only virtual random signal are imaginary produced.
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.
Java GUI to analyze one (or more, in batch mode) datasets with several feature selection methods at the same time and also performing an "ensemble" analysis. It can be easily extended to include any feature selection algorithm.
C++ Graph is a port of the Annas.Graph Java Library to C++. Visual components are excluded from this port. Will support Breadth First and Depth First Searches, Djikstra Algorithm for shortest path.
Springbots is a python application which takes a set of 2d physical structures built with nodes and movable springs and evolve them for specific tasks like walking, swimming and jumping using geneticalgorithm.
jIntersect is an OLAP like Javaalgorithm that takes a JDBC ResultSet as input and returns a data structure with all possible intersections, combinations and permutations of the data, pre-summarized at multiple levels for quick access.
Fair DJ is an Mserv compatible music server designed to play music in a room with several users sharing a set of speakers. The users can rate songs, and Fair DJ selects songs using these ratings and a fairness algorithm to ensure that everybody is happy.