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.
Get Started Free
Custom VMs From 1 to 96 vCPUs With 99.95% Uptime
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.
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.
BlueDS is a library that contains the implementation of frequently used data structures and algorithms in Computer Science. BlueDS is designed to be fast and efficient.
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.
A self-contained, fully configurable Java "game" to simulate multi-species evolution. Design species by optionally specifying every attribute; modify any or all environmental settings; let them loose to eat, fight, procreate, die, and Evolve!
GeneThello (read jə-ˈne-ˈthe-lō), is an acronym for genetic othello, an othello (reversi) playing program which based on Genetic Algorithm (GA). In principle GeneThello consist of an othello program and a genetic algorithm system.
This is a general purpose expression evaluator which has abilities to evaluate mathematical expressions having operators: +, -, *, /, < , <=, >, >=, ==, !=, &&, ||. The enhancement to support all the other arithmetic operators is under development.
FM-index is a compressed text index appeared in 2000 (http://pizzachili.dcc.uchile.cl/indexes/FM-indexV2/). A recent algorithm allows to update a FM-index (http://dx.doi.org/10.1016/j.jda.2009.02.007). Here, you'll find the implementation.
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.
A generic implementation of STL containers and some STL algorithms. The main intent is no make this STL implementation to work with any kind of pointers defined by allocator classes, e.g. memory_mgr::offset_ptr.
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.
clibutils is collection of common data structures , This library supports any type, Following are the datastructures currently implemented.
1. Dynamic Array
2. Single Linked List
3. Heap
4. Map
4. Set.
Modules for developing, configuring and running a computation based on function blocks entirely in Python. Function block based computation is a data, event and state driven approach to data processing.
My personal computing suite provides some programs I developed as a hobbyist and currently include a lambda calculus interpreter and a calculator which solves arithmetic expressions; both are written in C++.
Stochastic discrete event system analysis and verification are essential in order to ensure reliability in such systems. However, models that cannot be constructed with an hand-made process need to be learned. Thus, the SDES toolbox proposes an automated solution that is embedded in Matlab to learning and analisis generalized semi-Markov processes.