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
Ship Agents Faster
Transform your applications and workflows into powerful agentic systems at global scale.
Gemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
The Boehm-Demers-Weiser conservative garbage collector. The CVS source of the version 7+ collector resided here for a while, but is now on github. Other information and release snapshots are currently at http://hboehm.info/gc
Lightweight prime number generation library. Makes use of OpenMP and aims for performance. Suitable for applications in cryptography or just for educational demonstration.
Este proyecto constituye una adaptacion y mejora del codigo ANFIS de dominio público de Roger Jang. / This project is an adaptation and improvement of the original public domain ANFIS code of Roger Jang.
AppSignal's MCP server hands Claude, Cursor, or Zed your real errors, traces, and the deploy that shipped them. AI writes the fix; you review the diff.
Java classes that enable definition of new Charsets based on other existing Charsets, without additional programming. Includes a character set with Kamenik encoding.
New to Google Cloud? Get $300 in credits to explore Compute Engine, BigQuery, Cloud Run, Gemini Enterprise Agent Platform, and more.
Start your next project with $300 in free Google Cloud credit. Spin up VMs, run containers, query petabytes in BigQuery, or build agents with Gemini Enterprise Agent Platform. Once your credits are used, keep building with 20+ always-free tier products including Compute Engine, Cloud Storage, GKE, and Cloud Run functions. No commitment required—just sign up and start building.
Geneur is an Open Source scheduler for GRID. It is based on variation of genetic algorithms. Geneur uses backfill scheduling algorithm to create first genetic population.
LSGTL means LLX’s Static Graph Template Library which is a light-weighted header-only template library developed mainly for static graph analysis. LSGTL is expected to be used in laboratories for research purposes mostly.
OptFlow is a C++ -based library for motion detection. It implements the classical Lucas-Kanade algorithm and a more advanced algorithm by Proesmans et.al. Several warping and morphing methods using the computed motion fields are also implemented.
a simple software implemented FPU. only 32bit precision is supported and the operation result is not accurate as modern FPUs, but it is light and compact. (uses simple 32bit integer operations only, good for machines that has no hardware FPU.)
A simple Ternary Search tree implementation, which also includes delete and getting common prefixes operation. I've tested it on Linux WindRiver 1.4 box with g++. Please report bugs at kunalekawde2002@yahoo.com
ARMR provides a foundation for creating an efficient in-memory database. Its unique list processing structures simplify programming logic and allow the developer to rapidly sort, group, and select data. Give your app a hypercard like capability.
SDL_Collide is a simple 2D collision detection library for SDL supporting pixel perfect collision tests between surfaces, bounding box collision checks and circle intersection routines.
NT2 is a multi-platform C++ library providing various template matrix classes that can be used with a Matlab(tm) like syntax whose performances are close to those obtained with hand written C code. NT2 comes with various numerical toolboxes.
Classroom allocation using Genetic Algorithms and restricted mutation. Developed by AIGroup: Pablo Cababie, Facundo Cancelo, Alvaro Zweig y Gabriel Barrera
Implementation of paralell partitioning algorithms achieving an optimal number of comparisons. See L. Frias and J. Petit. Parallel partition revisited. http://dx.doi.org/10.1007/978-3-540-68552-4_11 for further reference.