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
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.
Aim is to develop a library of utility functions to efficiently simulate division, multiplication, mod, finding first 1/0 bit etc. (using shift and add/subtract) for software development on low cost dsp systems lacking these.
This project aims to provide developers a convenient library about graph theory algorithm and some basic data structures. It will be developed in Java via Eclipse IDE, supporting both win32 and linux systems, and published as jar files.
This project aims at providing a set of tools for solving the class of monodimensional packing problems (such as cutting stock, bin packing and knapsack problem) mainly using genetic algoritms.
A C library, providing comfortable APIs for a wide range of Finite State Abstract Machines (NFA, DFA, FST, Bimachines, etc). Implements most of the classical algorithms in the field.
LibPPQ is a small C++ library with templates that aims to be a "persistent" drop in replacement for the std::priority_queue template. Other than std::priority_queue however libppq limits its priorities to be unsigned integers.
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.
Mr. Logister is a resource scheduling application that uses genetic algorithms to find the best utilization and allocation of resources. The scheduler understands hard constraints like free/busy time and soft constraints like suitability and preferences.
JPortForwarder Project
JPortForwarder is a multithreaded TCP Port Forwarder application.
The following feature have been developed:
- Generic TCP Port Forwarging. Listen for a port and forward to an ip:port.
- Multihoming TCP Port Forwarding.
neochip is a collection of algorithms for high-density oligonucleotide microarrays. The current version contains heuristic algorithms that attempt to improve the quality of arrays by re-designing their layout (the location of the probes on the chip).
Neural network libraries in many different languages compatible with each other, such that neural networks can be trained on one platform and utilised on another.
The OS561 operating system based around FORTH/Java. The OS is to run on a VHDL chip OpenHardware design called the Minon, but could become available for other platforms. The unique point of the design is a revolutionary data compression technology.
eBarter froms trades from commitments. It measures economic values without the need of a common value standard; distributes fairly the gain produced between participants and gives the preference to trades where participants have the weakest requirements.
It moves by itself inside networks like virus infection & plagues, it is being written to solve computer virus problem drastically and responsibly. It is legal, free and open for public domain to improve W3 ICT Security.
...b. Descripción de los costes computacionales y requisitos
tecnológicos.
c. Manual de usuario del programa desarrollado.
FASES
1. Entrega de la memoria preliminar (límite: 24 de febrero) (1 punto).
2. Entrega del ejecutable (4 puntos) y de la memoria final (3 puntos)
(límite: 23 de mayo).
3. Presentación del trabajo (2 puntos) (28 de mayo).