Deploy in 115+ regions with the modern database for every enterprise.
MongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
Start Free
$300 Free Credits to Build on Google Cloud
New customers can spin up VMs, build with AI, and query data at no cost.
Put your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
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.
The Movinator is a movie database application. It manages information about movies plus ratings assigned to movies by movie critics. Based on these ratings and user ratings, the application can also make movie recommendations.
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.
Tina's Random Number Generator Library (TRNG) is a state of the art C++ pseudo-random number generator library for sequential and parallel Monte Carlo simulations.
The C++-programs simulate : Nondeterministic/Deterministic Multitape Turing & Post Machines, Universal Turing Machine, Turing Machine with faults, failures and recovery.
Dieser Parser, soll arithmetische Ausdrücke, die als String vorliegen, ausrechnen, bzw. diverse Funktionen darauf anwenden können. Bis jetzt kann er nur Audrücke wie "4^(5+2)-23*4/cos(3)" ausrechnen. er unterstützt auch vergleichsoperatoren
Syntactic is a simple C++ library for constructing general Neural networks. For now the library supports creation of multi layered networks for the Feedforward Backpropagation algorithm as well as Time Series Networks. More will be implemented soon.
Secure by design, portable by default. Recover clean, fast, anywhere. Start a free trial.
Try Veeam Data Platform today. Experience the unified platform that's secure by design, portable by default, and proven to recover clean, fast, and anywhere.
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.
the c prototyping tools library provides thread-safe linked list, priority queue, hash table, hash list, AVL tree and trie implementations, as well as a thread pool and thread management framework, a tcp and http socket api, and a dbms abstraction layer.
SMART (Shape Matching Algorithm Research Tool) enables you to implement 2D and 3D shape matching algorithms as plugins. Plugins can either be implemented in Java or as native plugins, i.e. in C/C++.
WordSort is an algoritm written in c# specifically designed for string sorting with linear complexity. Based on partial hashing approach, provides higher performance than classical algorithms that use the comparison. WordSort includes a console application easy and intuitive to use to evaluate and compare algorithms performance. Only Ordinal sorting and non-case-sensitive sorting provided.
The class 'JSEvaluator' in this project allows us to interpret expressions in JScript, allowing us to use parameters in the server at runtime.
For example:
({@ 1} + {@ 2}) / 100;
Parameter {@ 1} : 36
Parameter {@ 2}: 45
Result of the expression: 0.81
Zero Sum Game Solver Java Library is open source java library to solve 2-player finite zero-sum games. This programs solve zero-sum games with linear programming.
Testbed for playing with the algorithm "pagerank" of Google
Provide a testbed to play with pagerank-like algorithm on graph. You can easily add vertices, edges, save the graph for reuse, etc. For now, only Pagerank is implemented, but in the future, other algorithms will be added.
This is a Java-based project for complex event extraction from text and co-reference resolution. Currently the code can read BioNLP shared task format (http://2011.bionlp-st.org/) and i2b2 Natural Language Processing for Clinical Data shared task format (https://www.i2b2.org/NLP/DataSets/Main.php). Event extraction includes finding events and the parameters for an event in a text.
The method is based on SVM but other ML algorithms can be adopted. The method details are explained in the...
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.
General purpose library (and some tools) that allows the construction of recursive deterministic/non-deterministic automaton from non-deterministic settings.
Framework for development of simple evolutionary algorithms / island models programs in distributed environment using MapReduce programming model based on hadoop.