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
Stop Storing Third-Party Tokens in Your Database
Auth0 Token Vault handles secure token storage, exchange, and refresh for external providers so you don't have to build it yourself.
Rolling your own OAuth token storage can be a security liability. Token Vault securely stores access and refresh tokens from federated providers and handles exchange and renewal automatically. Connected accounts, refresh exchange, and privileged worker flows included.
Open-Source Framework for Distributed Constraint Optimization (DCOP)
FRODO is a Java platform to solve Distributed Constraint Satisfaction Problems (DisCSPs) and Optimization Problems (DCOPs). It provides implementations for a variety of algorithms, including DPOP (and its variants), ADOPT, SynchBB, DSA...
CloudI is an open-source private cloud computing framework for efficient, secure, and internal data processing. CloudI provides scaling for previously unscalable source code with efficient fault-tolerant execution of ATS, C/C++, Erlang/Elixir, Go, Haskell, Java, JavaScript/node.js, OCaml, Perl, PHP, Python, Ruby, or Rust services.
The bare essentials for efficient fault-tolerant processing on a cloud!
Generates Latin squares and counts their transversals
The Latin Square Toolbox contains software tools for efficiently generating Latin squares and counting their transversals with various user-configurable options.
This open source release aims to help educate folks on Latin squares and their important applications to cryptography. This version contains three tools:
0. Latin Square Generator (LSG)
1. Latin Square Transversal Counter (LSTC)
2. Latin Square Property Checker (LSPC)
Lascer liefert zu einer Menge binär klassifizierter Attribut-Vektoren eine Menge von Regeln zur Beschreibung der Klassen. Die Regeln können auch mathematische Funktionen enthalten, deren Art vorgegeben werden kann.
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.
NEW OPTIMIZATION TECHNOLOGY & PLANNING EXPERIMENT. Technology is designed for multidimensional optimization practical problems with continuous object functions. Technology higher efficiency than traditional optimization methods.
mathCollection is a java package representing a consistent and efficient extension to the Java Collection Framework of JDK 1.4. It offers different kinds of sets with mathematical, non-destructive functions.
JGAP is a Genetic Algorithms and Genetic Programming package written in Java. It is designed to require minimum effort to use, but is also designed to be highly modular. JGAP features grid functionality and a lot of examples. Many unit tests included.
Legal notice/Impressum:
Klaus Meffert
An der Struth 25
D-65510 Idstein
sourceforge <at> klausmeffert.de
Semantic query optimization (SQO) is the process of finding equivalent rewritings of an input query given constraints that hold in a database instance. We present a Chase & Backchase (C&B) algorithm strategy that generalizes and improves on well-known methods in the field. The implementation of our approach, the pegasus system, outperforms existing C&B systems an average by two orders of magnitude. This gain in performance is due to a combination of novel methods that lower the complexity...
Lay a foundation for success with Tested Reference Architectures developed by Fortinet’s experts. Learn more in this white paper.
Moving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
HOOPLE is a portable collection of C++ source code, featuring thread-safe objects for collections and event processing, RPC-style plugin-based encrypted networking (CROMP / octopus), bookmark collection management utilities, and a lot of other cool stuff.
This is the project page for HOOPLE version 1, which was retired on September 25 2010. The code supposedly still builds on both Linux (with gnu gcc) and on Windows (with ms visual studio).
Most of the code from hoople1 has moved into...
JaNaG is a Java random name generator for role-games, authors, and the like. It is based on a name fragment database that creates relatively reasonably sounding names. It can run as applet, GUI appliance, command line tool, or on a server-client basis.
Framework for development of simple evolutionary algorithms / island models programs in distributed environment using MapReduce programming model based on hadoop.
X-GAT (XML-based Genetic Algorithm Toolkit) is a Java framework to optimize problems with Genetic Algorithms (GAs). Differently from other frameworks, X-GAT contains ready-to-use GAs implementations and new features can be easily added.
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.
a framework library with a template method interface and inheritable classes for an executable process design which produces an executable which is both a GUI and a console application. It provides multi-threading for work items of the provider process .
Design and develop Recommendation and Adaptive Prediction Engines to address eCommerce opportunities. Build a portfolio of engines by creating and porting algorithms from multiple disciplines to a usable form. Try to solve NetFlix and other challenges.
FORce based Cluster Editing (FORCE) is a Java software heuristically solving the graph cluster editing problem on weighted edges using BLAST E-values. It further provides a training mode for heuristic parameter estimation.
LiMa means Lightweight Markup Language. It is a parser for an easy to use ASCII/Text-based markup - comparable to Markdown or the Wikipedia-Markup language with special configurable extensions in defining Links and image-resources.
SimMetrics is a Similarity Metric Library, e.g. from edit distance's (Levenshtein, Gotoh, Jaro etc) to other metrics, (e.g Soundex, Chapman). Work provided by UK Sheffield University funded by (AKT) an IRC sponsored by EPSRC, grant number GR/N15764/01.
basE91 is an advanced method for encoding binary data as ASCII characters. It is similar to UUencode or base64, but is more efficient. The overhead produced by basE91 depends on the input data. It amounts at most to 23% and can range down to 14%.
StrMatch is a simple java program, created for educational purposes, that allows user to test a great part of string matching algorithms.
An intuitive user interface shows each algorithm step accurately...