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.
Start Free
Build AI Apps with Gemini 3 on Vertex AI
Access Google’s most capable multimodal models. Train, test, and deploy AI with 200+ foundation models on one platform.
Vertex AI gives developers access to Gemini 3—Google’s most advanced reasoning and coding model—plus 200+ foundation models including Claude, Llama, and Gemma. Build generative AI apps with Vertex AI Studio, customize with fine-tuning, and deploy to production with enterprise-grade MLOps. New customers get $300 in free credits.
SwarmTSP is a library of swarm intelligence algorithms for the Traveling Salesman Problem. Currently, it implements Ant Colony Optimization and Consultant-Guided Search algorithms.
EXTE recognizes temporal expressions in a text. Temporal expressions are any references to the TIME e.g.: "today", "12th march 2006", "as soon as he woke up". This analyzer will recognize three languages: Spanish, English and French.
KeplerWeka adds the functionality of the open-source machine learning and data mining workbench WEKA to the free and open-source, scientific workflow application, Kepler.
JavaRisk v2 is a strategic game roughly based on the board game Risk. The game features network support for multiplayer games, hot-seat sessions for playing with friends on one PC & a challenging Ai. We also provide an implementation of the original Risk
With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.
You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
POGG (Programação Orientada a Gráficos de Gantt) é um modelo de programação que permite a distribuição de tarefas num Sistema Multiagente (SMA) criado com a plataforma JADE (Java Agent DEvelopment Framework), formando uma grade computacional.
Toroid experiment is a try to create a model of life where animals evolving driving by genetic algorithms and each animal has it's own brain which is a neural network. For detailed description look at project page http://toroid-world.sourceforge.net
ROS repository for human-robot engagement package, developed at Worcester Polytechnic Institute. Currently contains ROS stack for recognizing and generating connection events. This work is supported by the NSF awards IIS-0811942 and IIS-1012083.
DCOPolis is a framework for comparing and deploying distributed decision processes in heterogeneous environments, including simulation in a virtual machine.
superseded by SgpDec http://sgpdec.sf.net Java implementation of the holonomy algorithm for the algebraic hierarchical decomposition of finite state automata.
Save up to 91% with Spot VMs and get automatic sustained-use discounts. One free VM per month, plus $300 in credits.
Save on compute costs with Compute Engine. Reduce your batch jobs and workload bill 60-91% with Spot VMs. Compute Engine's committed use offers customers up to 70% savings through sustained use discounts. Plus, you get one free e2-micro VM monthly and $300 credit to start.
SimIS presents an agent-based simulation environment from multiagent research to simulate Internet-of-Services systems. The simulation environment bases on Repast Simphony 1.2 (http://repast.sourceforge.net/).
Contextor is a light-weight simple-to-use Java based library to help developers and researchers working with the general concept of a resource; as examples, resources can be text resources, web resources, images and videos.
A generic library made to represent Puzzles and programs to solve them (Solvers), a specialization for 2d puzzles, specialization for the N-Puzzle, Several solving algorithms for the N-Puzzle. Command line and Graphical User Interface for N-Puzzles.
A java-swing application that provides a tree-view of a jena rdf-graph.
This is a tool for developers utilizing jena or pellet who wish to see what is going on within their jena-model when inference occurs.
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.
BorderFlow implements a general-purpose graph clustering algorithm. It maximizes the inner to outer flow ratio from the border of each cluster to the rest of the graph.
ML@IUL is a class-project of the Machine Learning (ML) course at DCTI (Department of Computer Science and Technology), IUL (ISCTE - Lisbon University Institute). The objective is to create an ML library from student assignments.
Maximum entropy is a powerful method for constructing statistical models of classification tasks, such as part of speech tagging in Natural Language Processing. Several example applications using maxent can be found in the OpenNLP Tools Library.
SAIM allows to interlink knowledge bases in the Semantic Web. It focuses on instance matching of very large knowledge bases available as SPARQL endpoints. SAIM uses machine learning techniques and is compatible with SILK.
Wikipedia Concept Association Map (WCAM) is new approach for textual knowledge representation and understanding. All concepts and associations are stored in a graph database for better performance and easy distribution.