Can you recover when it matters most? Take this quick assessment to identify gaps and build greater recovery confidence.
Is your recovery strategy as strong as you think? Take this quick self-assessment to check your recovery readiness and gain tailored insights. In only 2 minutes, you'll learn where you fall on the recovery readiness scale.
Take the Assessment
MongoDB Atlas runs apps anywhere
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.
We propose a metabolic pathway drawing algorithm for reducing the number of edge crossings by considering the fact that metabolic pathway graph is scale-free network.
PGAF provides a framework tuned, user-specific genetic algorithms by handling I/O, UI, and parallelism. It is designed for optimizing functions that take a "very long time" to evaluate.
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.
Shape is a molecular conformation prediction program. It uses a geneticalgorithm to efficiently search the conformational space of a biomolecule and then clusters the results. It is very simple to use.
Put idle assets to work with competitive interest rates, borrow without selling, and trade with precision. All in one platform.
Geographic restrictions, eligibility, and terms apply.
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.
EMURA is a suite of Java applications that allows two users to send encrypted messages back and forth - as a chat. The encryption key is secure and generated using the Diffie-Hellman algorithm. Utilizes GNU-CRYPTO libraries
The implementation of Bee Hive @ Work algorithm that simulates the foraging behavior of honey bees in nature. The aim is to provide an extensible framework that can be used by researchers to simply create new applications of this algorithm.
A Java package for pretty-printing a text by deciding where to introduce line-breaks and indentation. A Java implementation of Derek Oppen\'s pretty printing algorithm. It is _not_ a pretty printer for Java code, though it could be used to write one.
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.
MelodyBall generates a simulated array of soundmaking bars, on which a ball bounces and plays a melody (see www.melodyball.com). Need to fix Java/MIDI bugs and read MIDI files as source data for the algorithm to create alternate melodies.
The goal: to provide implementations of as many algorithms (sorting, searching, ...) and data structures (lists, trees, ...) as possible, accompanied by discussion of big O run time and memory limits and references to sources of further study.
a first work algorithm trials to implement a compromise between distributed and centralized version control system.part of research project,it's only a simulation. no real networking is implemented ,only virtual random signal are imaginary produced.
This is an implementation of Donald Knuth's Algorithm X ("dancing links"). This is primarily a sudoku generator and solver, though it can be used to solve other exact cover problems.
Java GUI to analyze one (or more, in batch mode) datasets with several feature selection methods at the same time and also performing an "ensemble" analysis. It can be easily extended to include any feature selection algorithm.
C++ Graph is a port of the Annas.Graph Java Library to C++. Visual components are excluded from this port. Will support Breadth First and Depth First Searches, Djikstra Algorithm for shortest path.
Java API for implementing any kind of GeneticAlgorithm 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.
jIntersect is an OLAP like Javaalgorithm that takes a JDBC ResultSet as input and returns a data structure with all possible intersections, combinations and permutations of the data, pre-summarized at multiple levels for quick access.
gaKnn(GeneticAlgorithm Optimized K Nearest Neighbor Classification framework) is a frameowork for KNN optimization with a geneticalgorithm. The genetic algothm used for this is JGAP (http://jgap.sourceforge.net/).