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.
Start Free
Demo Series - Small Business Backup By Veeam
Learn how to protect your Microsoft 365 data, with simple, actionable tips today.
Watch this on-demand demo series and learn how to protect your Microsoft 365 data with clear, simple, actionable steps that are easy to implement for businesses of all sizes.
JaCoP is a Java Constraint Programming solver. It provides a significant number of (global) constraints to facilitate efficient modeling of combinatorial problems, as well as modular design of search. Documentation is available at project Web site.
Please, note that the sources from version 4.0 are only available at GitHub.
-----------------
- What is it? -
-----------------
The "Falcon Search" is a JAVA API and tool to search inside the
documents. It was originally started to search the content in pdf files
under the project "HAWK Search".
Searching with this tool is query-based not word-based as in most
of the document search tools OR document readers. It also takes care
of jumbling of words within query and spelling mistakes.
Commonly used techniques in this project are Natural Language...
EasyPastry is built on top of Pastry, a decentralized key-based routing (KBR) P2P overlay network. The main objective of EasyPastry is to provide a complete façade in order to simplify the P2P application development.
New customers can spin up VMs, build with AI, and query data at no cost.
Put your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
This is a FreeCell solitaire game solver written in the Java. It is fast and capable - it solves all of the first million Microsoft deals in about 4 hours - 99.99% of them in less than a second, and no deal takes more than 1 minute.
The project contains algorithms for locating the most central groups in complex networks. In particular implementations of various centrality measures and heuristic search algorithms. All functionality is exposed via XML-RPC for easier exploitation.