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.
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.
MobileMath is a software written by using J2ME technolology. It turns mobile into calculator supporting many operations such as : evaluate expression, plotting, differentiate & integrate expression... It can run on any mobiles supporting Java.
Wallaroo is an infinite precision constraint solving and optimization library for linear constraints over the rational numbers. It handles equalities (=), inequalities (<=, >=), strict inequalities (<, >), and disequalities (!=).
neochip is a collection of algorithms for high-density oligonucleotide microarrays. The current version contains heuristic algorithms that attempt to improve the quality of arrays by re-designing their layout (the location of the probes on the chip).
brCluster is a class library, written in java, that implements generic clustering algorithms carefully designed to allow its aplication in any kind of data. The algorithms implemented are K-means and Hierarchical Clustering (Simple and Complete Link).
A java framework for developing meta-heuristics that supports the use of grids environments. The meta-heuristics planned to be realeased are GAs, VNS and NNs. The grid middleware that will be firstly explored is the OurGrid solution.
RL++ is an easy to use modular open source library for Reinforcement Learning written in C++. It includes learning algorithms (TD, Sarsa, Q) as well as the implementation of value function representations (LookupTable, TileCoding, Neuronal Network).
The Parameter Tuning Unity (PTU) aims to adapt the parameters of ever connected multi-agents system, or expert system with a plugged optimization heuristic likes the descent of gradient for instance.
It moves by itself inside networks like virus infection & plagues, it is being written to solve computer virus problem drastically and responsibly. It is legal, free and open for public domain to improve W3 ICT Security.
NeoBio is a Java class library of Computational Biology Algorithms. The current version consists mainly of pairwise sequence alignment algorithms such as the classical dynamic programming methods of Needleman-Wunsch and Smith-Waterman.
The LisBON Framework is an adaptable framework for developing new parallel Memetic Algorithms (hybrid search algorithms for efficiently solving optimisation problems).
The Arbitrarily-Decomposed MPI FFT library is a C subroutine library for the computation of the multidimensional Fast Fourier Transform (FFT) of a distributed grid using the Message-Passing Interface (MPI).
Application to automatically merge gedcom files. It provides either a user or another program the ability to merge gedcom files with as little human interaction as possible and with high quality of matching results.
This projects implements various optimization heuristics and meta-heuristics (such as local search, VND, GRASP, Simulated Annealing, and more still to come) finding solutions on the post enrolment course timetabling problem.
Web-Service for discrete dynamic systems' model description and simulation. Firstly, recursive procedures of stochastic optimization are added. The framework for open and closed loop model description and simulation.
reputron is a knowledge extraction engine platform that covers all aspect of text mining, relevance, indexing and querying on a corpus of text documents.
This STL-like C++ library contains classes for long integer numbers processing with using of assembler functions as a backend. Lazy evaluation is also used for optimization. It also contains generic implementation of classical number-theory algorithms.