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.
This educational software simulates an Ad-hoc network with AODV algorithm, it uses a high level view and only works in Routing layer. it has a user-friendly graphical user interface and has been written in java language.
MeMo (stands for Meta-Model) is planned as Generic Programming Language & IDE, as flexible & smart as it is possible for computer application, including adjustable syntax, algorithm reduction. Ideally, it has to contain AI for interacting with the user.
The Automatic Model Optimization Reference Implementation, AMORI, is a framework that integrates the modelling and the optimization processes by providing a plug-in interface for both. A genetic algorithm and Markov simulations are currently implemented.
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.
PyLife is an implementation of the game of life algorithm featuring parallel programming. It uses MPI and python to achieve a consistent software architecture and reliably performance.
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.
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.
Proposed is an algorithm
that uses computer vision, combined with a modified Rubine classifier, to allow
arbitrary N-sided polygons as accepted sketches in real-time.
Library of terrain level of detail algorithm nodes for Coin (an implementation of an Open Inventor scene graph) and other utility classes. Currently are implemented ROAM, Geo Mip-Mapping and Chunked-LoD algorithms. Any issues and feedback for this projec
The Markovski project implements an interpreter/compiler for a language named Markovski, used to write Markov algorithms (see http://en.wikipedia.org/wiki/Markov_algorithm).
pythag is an algorithm and script for computing primitive Pythagorean triples using the command line. Has an option to output to a file. It also has an option to output to a graph using GLUT, to which it now depends.
A flexible programming library for evolutionary computation. Steady-state, generational and island model genetic algorithms are supported, using Darwinian, Lamarckian or Baldwinian evolution. Includes support for multiprocessor and distributed systems.
Project Tokaf is an general implementation of top-k algorithm. It provides interfaces for all modules that are needed. It also features user preferences module, for computing new preferences and manipulating existing ones.
KNN-WEKA provides a implementation of the K-nearest neighbour algorithm for Weka. Weka is a collection of machine learning algorithms for data mining tasks. For more information on Weka, see http://www.cs.waikato.ac.nz/ml/weka/.
The main goal of OWLVE is to visualize graphically any OWL–lite file. Using powerful RCP and GEF technologies will improve the quality of graphics and diagrams.This project includes an algorithm for similarity calculus between two OWL files.
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.