Access competitive interest rates on your digital assets.
Generate interest, borrow against your crypto, and trade a range of cryptocurrencies — all in one platform.
Geographic restrictions, eligibility, and terms apply.
Get started with Nexo.
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.
Game Toolbox is a C# assembly designed to facilitate the creation of games and game prototypes. It contains no graphics code, does not depend on XNA, and is Mono-compatible. It provides implementations of A*, GOAP, a genetic algorithm, and more.
A branch-and-prune method to find all solutions to systems of nonlinear equations. The number of variables must equal the number of equations. The variables must have proper lower and upper bounds. The solver has an interface to the AMPL environment.
XPN is relies on a non relational native XML database, where XML documents are stored in a compressed form and indices enables fast access to structure and content, thus enabling a fast evaluation of XQuery queries.
Give your IT, operations, and business teams the ability to deliver exceptional services—without the complexity.
Freshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.
The Boehm-Demers-Weiser conservative garbage collector. The CVS source of the version 7+ collector resided here for a while, but is now on github. Other information and release snapshots are currently at http://hboehm.info/gc
Lightweight prime number generation library. Makes use of OpenMP and aims for performance. Suitable for applications in cryptography or just for educational demonstration.
Este proyecto constituye una adaptacion y mejora del codigo ANFIS de dominio público de Roger Jang. / This project is an adaptation and improvement of the original public domain ANFIS code of Roger Jang.
Geneur is an Open Source scheduler for GRID. It is based on variation of genetic algorithms. Geneur uses backfill scheduling algorithm to create first genetic population.
a simple software implemented FPU. only 32bit precision is supported and the operation result is not accurate as modern FPUs, but it is light and compact. (uses simple 32bit integer operations only, good for machines that has no hardware FPU.)
LSGTL means LLX’s Static Graph Template Library which is a light-weighted header-only template library developed mainly for static graph analysis. LSGTL is expected to be used in laboratories for research purposes mostly.
OptFlow is a C++ -based library for motion detection. It implements the classical Lucas-Kanade algorithm and a more advanced algorithm by Proesmans et.al. Several warping and morphing methods using the computed motion fields are also implemented.
A simple Ternary Search tree implementation, which also includes delete and getting common prefixes operation. I've tested it on Linux WindRiver 1.4 box with g++. Please report bugs at kunalekawde2002@yahoo.com
ARMR provides a foundation for creating an efficient in-memory database. Its unique list processing structures simplify programming logic and allow the developer to rapidly sort, group, and select data. Give your app a hypercard like capability.
NT2 is a multi-platform C++ library providing various template matrix classes that can be used with a Matlab(tm) like syntax whose performances are close to those obtained with hand written C code. NT2 comes with various numerical toolboxes.
Implementation of paralell partitioning algorithms achieving an optimal number of comparisons. See L. Frias and J. Petit. Parallel partition revisited. http://dx.doi.org/10.1007/978-3-540-68552-4_11 for further reference.
Sequential and parallel implementation of string quicksorts(-select) . Articles: On the number of string lookups in BSTs (and related algorithms) with digital access/ Combining digital access and parallel partition for quicksort and quickselect.