General-purpose, compute-optimized, or GPU/TPU-accelerated. Built to your exact specs.
Live migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
Try Free
Our Free Plans just got better! | Auth0
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.
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.
A library of standard data structures in C, similar to STL in C++. Includes variable-length arrays, deques, hashtables, avl trees, binary heaps, and many other useful structures, with a simple and intuitive interface.
Everything you need to build production-ready agents and models. Access 200+ Google and third-party AI models and tools.
Gemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
Fastest string utility is java library (JAR ) for string operation . This library is very easy to use, very fast and very efficient in string operations such as split, toUpperCase, toLowerCase, replace, delete, regular expression and others.
This project is primarily for testing and demonstrating ideas for an ultimate programming system, though it might very well become a very usable programming system in time. It is being developed with PowerBasic's PBWin7 compiler.
Framework for development of simple evolutionary algorithms / island models programs in distributed environment using MapReduce programming model based on hadoop.
This is a series of *.java Classes for making programming tasks simpler, much like Apache Commons. Included in this src package is an Advanced Randomizer, TStringList Clone From Delphi, an Algorithem Class, and Method MultiTask Better than Runnables.
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.
20 SkipList containers for C++ that work with STL. Combines set/map functionality with random access in logn time. One container is a multilist where you can order the same elements in a variety of different ways simultaneously.
AlgoExplorer is a dynamic data structures viewer for Java.
It allows the visualization of data structure of a Java program, allowing you to see how objects, handled by the algorithms, interact with each other and how they are related and linked.
The project has been moved on:
http://code.google.com/p/algoexplorer/
Delphi class which implements an associative array. Keys can be strings or integers. Keys are stored in Red-Black tree. Array can contain TObjects or it descendants.
ExtraDix is a sorting algorithm based on Radixsort. It is faster than Quicksort, stable, realized in C and can sort by any basic data type. Testing was done with 1 million data records sorting char, short, int, long, float, double and strings.
iGesture is a Java-based gesture recognition framework providing access to multiple gesture recognition algorithms and different input devices. The iGesture Workbench supports the definition and evaluation of customised gesture sets and algorithms.
SWARD (System for Weapon Allocation Research and Development) is a testbed for benchmarking weapon allocation algorithms against each other. It is intended for researchers within operations research, information fusion, and related areas.
Headrand is a static library wrote in c that contains functions to simulate complex systems or make statistical analysis with a new approach called "random function computing"