Host and run your applications without the need to manage infrastructure. Scales up from and down to zero automatically.
Cloud Run is the fastest way to deploy containerized apps. Push your code in Go, Python, Node.js, Java, or any language and Cloud Run builds and deploys it automatically. Get fast autoscaling, pay only when your code runs, and skip the infrastructure headaches. Two million requests free per month. And new customers get $300 in free credit.
Try Cloud Run Free
99.99% Uptime for MySQL and PostgreSQL on Google Cloud
Enterprise Plus edition delivers sub-second maintenance downtime and 2x read/write performance. Built for critical apps.
Cloud SQL Enterprise Plus gives you a 99.99% availability SLA with near-zero downtime maintenance—typically under 10 seconds. Get 2x better read/write performance, intelligent data caching, and 35 days of point-in-time recovery. Supports MySQL, PostgreSQL, and SQL Server with built-in vector search for gen AI apps. New customers get $300 in free credit.
Linear Program Solver (Solvexo) is an optimization package intended for solving linear programming problems. The main features of the Solvexo are:
· Solvexo solver is based on the efficient implementation of the simplex method (one or two phases);
· Solvexo provides not only an answer, but a detailed solution process as a sequence of simplex matrices, so you can use it in studying (teaching) linear programming.
· Solvexo provides a solution with the graphic method for problems with...
Shears is a C# library for list processing, combinatorial problems, and functional programming. It is intended to be useful for everyday coding, with an emphasis on producing brief, readable code. It's also lots of fun!
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.
From dev environments to AI training, choose preset or custom VMs with 1–96 vCPUs and industry-leading 99.95% uptime SLA.
Compute Engine delivers high-performance virtual machines for web apps, databases, containers, and AI workloads. Choose from general-purpose, compute-optimized, or GPU/TPU-accelerated machine types—or build custom VMs to match your exact specs. With live migration and automatic failover, your workloads stay online. New customers get $300 in free credits.
Many people love programming contests. There are tons of contests or online judges like TopCoder, UVA, SPOJ, etc. This project's goal is to store and keep track of what a programmer have done and studied so far.
GEP is an evolutionary algorithm for function finding. This framework is a powerful way of expressing and coding genetic-like structures and quickly finding solutions through evolution by common genetic operators.
A "programming language" that can generate random strings. Useful for creating password, but has many other uses (it can generate IP addresses, fully random but pronounceable words, ..., anything that a string can represent). Written in C#
Provides functional programming abstractions for C# including map, fold, filter functions for .NET collections, the option data type, a lazy type, a functional list type, lazy functional lists, and more. Superseded by http://sf.net/projects/sasa/
Go from Data Warehouse to Data and AI platform with BigQuery
Build, train, and run ML models with simple SQL. Automate data prep, analysis, and predictions with built-in AI assistance from Gemini.
BigQuery is more than a data warehouse—it's an autonomous data-to-AI platform. Use familiar SQL to train ML models, run time-series forecasts, and generate AI-powered insights with native Gemini integration. Built-in agents handle data engineering and data science workflows automatically. Get $300 in free credit, query 1 TB, and store 10 GB free monthly.
Finds bad examples for the local search Path Partitioning algorithm
Path Partitioner constructs random graph partitions and solves the linear (or integer) programming problems that assign weights to the edges such that the performance ratio of the local search algorithm for the Path Partitioning problem is minimized. See http://www.tau.ac.il/~ohadschn/Thesis/Partitioning.pdf.
Requirements:
Microsoft Automatic Graph Layout
http://research.microsoft.com/en-us/projects/msagl/
Gurobi Optimizer
http://www.gurobi.com/
Permutations, Combinations, and Variations using C# Generics
http://www.codeproject.com/Articles/26050/Permutations-Combinations-and-Variations-using-C-G