Mixed Integer Linear Programming (MILP) solver lp_solve solves pure linear, (mixed) integer/binary, semi-cont and special ordered sets (SOS) models.lp_solve is written in ANSI C and can be compiled on many different platforms like Linux and WINDOWS
This project is moved to github: https://lp-solve.github.io/
Laxor is a C++ template library for componentwise tensor algebra, which uses the "Einstein" index notation in expressions and produces efficient binarycode.
A code for fast multi-dimensional density estimation . Instead of assuming an a-priori metric definition, it calculates a locally adaptive metric for each data point by using, a Shannon Entropy based, binary space partitioning scheme.
{sets} is a lightweight constraint programming language. The uniqueness of {sets}, is that it uses ROBDD ( Reduced Ordered Binary Decision Diagrams ) to represent and solve constraints.
New to Google Cloud? Get $300 in credits to explore Compute Engine, BigQuery, Cloud Run, Gemini Enterprise Agent Platform, and more.
Start your next project with $300 in free Google Cloud credit. Spin up VMs, run containers, query petabytes in BigQuery, or build agents with Gemini Enterprise Agent Platform. Once your credits are used, keep building with 20+ always-free tier products including Compute Engine, Cloud Storage, GKE, and Cloud Run functions. No commitment required—just sign up and start building.
Numerically estimate an efficiency of code construction algorithms. Randomly generate n binary words of length m with minimum Hamming distance d and create a prefix code (= retrieval tree) from them. Based on PhD work.
The Random Bit Generator Test Suite will take in large blocks of binary data and attempt
to tell the user what is not random about them. Code developers, mathematicians and
statisticans welcome to help.