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
Build Agents and Models on One Platform
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.
DWIP is short for Disk Wiping and Imaging Tool. This tool is being built for Mississippi State Universities National Forensics Training Center for use on a live cd to give out to it's students.
A character recognition software using a Back Propagation Algorithm for a 2-layered Feed Forward Non-Linear Neural Network. Written in Python, Graphics done using Pygame.
This is a simple spaced repetition flash card program. It is intended for daily use. You create the cards and learn them at your own pace. The program schedules them for review using a spaced repetition algorithm.
This project implements an algorithm for segmenting protein sequences into smaller meaningful blocks. The method is based on the pure statistical approach and it uses an analogy between proteins and natural language.
PGAF provides a framework tuned, user-specific genetic algorithms by handling I/O, UI, and parallelism. It is designed for optimizing functions that take a "very long time" to evaluate.
A threaded Web graph (Power law random graph) generator written in Python. It can generate a synthetic Web graph of about one million nodes in a few minutes on a desktop machine. It implements a threaded variant of the RMAT algorithm.
Springbots is a python application which takes a set of 2d physical structures built with nodes and movable springs and evolve them for specific tasks like walking, swimming and jumping using genetic algorithm.
This is an algorithm to codify Spanish words to an equivalent phonetic code. That intends to be a substitute of Soundex algorithm that is not practical to use in Spanish. It is very useful for search engines based on text information.
Processes boolean functions which can be provided either as a list of 0s and 1s or which can be provided as a formula in first-order logic (using disjunctive or conjunctive normal forms). Internally the Quine McCluskey algorithm is used.
Card credit checker, allows you to check credit card number for validity.
It can verify Visa, MasterCard, Diners Club, Carte Blanche, American Express (AMEX), Discover, card numbers.
it uses LUHN10 algorithm as well as first digits verification.
a program to directly find the prime factors quickly, we are attempting to create the fastest algorithm possible (note, this software is licensed under the WTFPL, a copy of the license is in the COPYING file of all tarballs attached to this project)
The Automatic Model Optimization Reference Implementation, AMORI, is a framework that integrates the modelling and the optimization processes by providing a plug-in interface for both. A genetic algorithm and Markov simulations are currently implemented.
PyLife is an implementation of the game of life algorithm featuring parallel programming. It uses MPI and python to achieve a consistent software architecture and reliably performance.
A simple (~20 line python) O(n^6) algorithm for the traveling salesman problem that seems to do pretty well for most graphs; so well that I have not been able to find a graph which it does optimally solve. Those with spare cycles are welcome to help out.
The Markovski project implements an interpreter/compiler for a language named Markovski, used to write Markov algorithms (see http://en.wikipedia.org/wiki/Markov_algorithm).
DrPangloss is a python implementation of a three operator genetic algorithm, complete with a java swing GUI for running the GA and visualising performance, generation by generation
The Peach Validator is a small program used verify the application of the Lhun's algorithm to s.i.n numbers. This program is designed to offer some insight into writting program wrappers or GUI applications with python.
PyPotrace is a Python programming language binding for Peter Selinger's Potrace raster to vector conversion algorithm. No separate Potrace library or application required!
This project aims to improve the Civilization 4 AI using a genetic algorithm. We also have some alternative AI algorithms which have been custom written that will hopefully also improve the AI.
A Python and ANSI C implementation of the Edelsbrunner hyperplane arrangement algorithm described in his book Algorithms in Combinatorial Geometry, supporting arbitrary dimensions, exact rational arithmetic using gmp, and using David Avis lrs solver.