MongoDB Atlas is the developer-friendly database used to build, scale, and run gen AI and LLM-powered apps—without needing a separate vector database. Atlas offers built-in vector search, global availability across 115+ regions, and flexible document modeling. Start building AI apps faster, all in one place.
Start Free
Our Free Plans just got better! | Auth0
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.
D-finder is a bioinformatic search algorithm for the identification of D-sites in JNK interacting proteins. The algorithm is a combination of pattern matching and a hidden markov model (HMM) based on a training set of known JNK D-sites.
ConTextKit is a Java-based implementation of Wendy Chapman's ConText algorithm for annotating the context of medical documents, specifically the negation, temporality, and experiencer.
AlViz is a research prototype for visual ontology alignment implemented as multiple-view plug-in for Protege using J-Trees and Graphs. Based on similarity measures of an ontology matching algorithm AlViz helps to assess and optimize the alignment results
G.A.V. (Graph Algorithm Visualizer) is a tool that visualizes algorithms from graph theory. A step-by-step visualization from each different algorithm allows the user to understand the particular algorithm very easily.
MCS is a tool that exploits the Monte Carlo method and, with a complex algorithm based on the PERT (Program Evaluation and Review Technique), it estimates a project's time.
MCS is a opensource project and it was devolped by Java Programming Language.
Java API for implementing any kind of Genetic Algorithm and Genetic Programming applications quickly and easily. Contains a wide range of ready-to-use GA and GP algorithms and operators to be plugged-in or extended. Includes Tutorials and Examples.
ECSKernel is a multiagent coordination algorithm testbed, built on the RoboCupRescue disaster simulation platform. It is easily configurable and can be used with user-generated scenarios.
Full access to Enterprise features. No credit card required.
What if You Could Automate 90% of Your Repetitive Tasks in Under 30 Days? At ServoDesk, we help businesses like yours automate operations with AI, allowing you to cut service times in half and increase productivity by 25% - without hiring more staff.
TBLTools is a set of GATE processing resources that implements the Fast Transformation Based Learning Algorithm. You can train it to learn rules for NLP tasks such as Named Entity Recognition and Shallow parsing.
A disk based production quality RTree based upon Guttmans quadratic split algorithm having following features:
Buffering with dirty write,
Index joins,
Tree Seeding,
Window and NN queries,
Runtime STR Packing capability,
Completely Thread safe.
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.
Primarily applied in experimental psychology, where it is used to create experiment schedules. It even can be applied to other planning-activities that have to met boundary constraints. Rando uses a genetic-algorithm to construct a fulfilled schedule.
TACS (Trust Ant Colony System) is a Trust model for P2P, Ad-hoc and Wireless Sensor networks (also valid for multi-agent systems) based on the bio-inspired algorithm ACS (Ant Colony System).
The simpliZia-program implements the simplex-algorithm and is designed to help students of Operations Research to understand and learn the algorithm. This is a german project, source and program are actually written in german.
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
This project intends to create an indexing search engine, for knowledge management. The primary object is to apply an information retrieval core. And implement a knowledge data discovery theory such as data mining algorithm, text mining.
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...
jGABL (the Java Graph Algorithm Base Library) is a java library for the implementation of graph algorithms. It covers a hierarchy of graph concepts, various graph implementations, and algorithm animation.
XML Universal Packet Archiver (PKT) is a platform independant universal file archiving system with pluggable options for encryption, encoding, compression, parity/RAID protection and more.