Start building on Google Cloud with $300 in free credits. No commitment, no credit card required until you're ready to scale.
Launch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
Start Free Trial
Save Up to 91% on Cloud Compute With Spot VMs
Automatic sustained-use discounts. One free VM per month. No negotiation needed.
Run batch jobs at 60-91% off with Spot VMs. Long-running workloads get automatic discounts with sustained use.
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.
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"
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.
Awakener aims to provide a Java library for solving practical, real world optimisation problems by means of genetic algorithms (turnkey algorithms for >= 90% of industry problems). Awakener extends Sleepwalker with specific algorithms.
Sleepwalker aims to provide a highly abstract, universal, reusable, extensible Java-based genetic algorithms framework which can be used as a basis for modelling and programming virtually any practical optimisation problem.
http://jocdelavida.piposerver.com - Online implementation of Conway's Game of the Life 0 players game, but using entities based on the nature, like animals or plants who born, grow up, reproduces breed and die. Written in Java 6 and Adobe Flex 3.
PHPXref is a developers tool, written in Perl, that will cross reference and extract inline documentation from a collection of PHP scripts. It generates simple HTML output suitable for browsing offline.
Regexp testing tool allows to apply group of regexps to huge arrays of data (millions or so) in order to investigate search or search/replacement possibilities of regexp group.
JoSQL (Java Objects SQL) provides SQL capabilities for querying, ordering and grouping of collections of Java objects (POJOs). It allows a SQL statement to be applied to the collection of objects and the matching set returned, ordered and grouped.
op4j is a developer happiness tool. Its aim is to reduce the amount of similar lines of code needed to do every day tasks in our code by providing an operator chaining tool to perform easy iterations on lists, OGNL evaluation, data type conversion...
An R package implementation of a consensus clustering methodology. This package allows users to perform re-sampling statistics based clustering using multiple clustering algorithms to assess the robustness of both clusters and members of clusters.
An interactive binary search tree. The user may interact with the tree by performing rotations, balancing, insertions, and deletions. For educational purposes
This projects hosts the worlds fastest algorithms for the labeling of point-features. It especially looks for algorithms thar are free of constraints, applicable to many scenarios (e.g., visualization, maps...) and do not need any preprocessing.
This library is a lightweight implementation of genetic algorithm, contains the most popular types of chromosomes and the basic algorithms for selection, elitism, crossing and mutation.
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
pack:tag is now available at github: https://github.com/galan/packtag
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
FPM - Fixed Point Math substitutes expensive floating point operations by much cheaper integer arithmetics. Use this library in your plain C (gcc) projects if you like.
An R package for detailed inspection and analysis of LCMS data. An R package developed by Sukhdeep Singh at Department of Surgery and Cancer, Imperial College London,UK.
The JSparse Matrix Package, developed by Philipp Geigenmüller during an internship at the prudsys AG in Chemnitz, Germany, is an extension of the well-known Java Matrix Package (JAMA) and allows the use of sparse matrices and related algorithms.
Java classes that enable definition of new Charsets based on other existing Charsets, without additional programming. Includes a character set with Kamenik encoding.