Search Results for "binary code generator"

XMDS is a code generator that integrates equations. You write them down in human readable form in a XML file, and it goes away and writes and compiles a C++ program that integrates those equations as fast as it can possibly be done in your architecture.

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/

Programmer's library for random numbers. Also random number generator testing code. Intended for simulation, games and "Monte-Carlo" algorithms.

...Technically, ganja.js is a code generator producing classes that reificate algebraic literals and expressions by using reflection, a built-in tokenizer and a simple AST translator to rewrite functions containing algebraic constructs to their procedural counterparts. ganja.js now has a nodejs based templated source generator that allows the creation of arbitrary algebras for C++, C#, python and rust.

TSPSG is intended to generate and solve Travelling Salesman Problem (TSP) tasks. It uses Branch and Bound method for solving. An input is a number of cities and a matrix of city-to-city travel prices. The matrix can be populated with random values in a given range (useful for generating tasks). The result is an optimal route, its price, step-by-step matrices of solving and solving graph. The task can be saved in internal binary format and opened later. The result can be printed or saved as...

Laxor is a C++ template library for componentwise tensor algebra, which uses the "Einstein" index notation in expressions and produces efficient binary code.

A Tiny Mathematical Speed Parser ATMSP is a portable C++ parser for mathematical expressions like "sin(x)+y^2" e.g. These may contain arbitrary numbers of functions, variables and constants. Major design goal was minimalistic size and maximum speed. Tiny 320 code-lines offer a parser plus bytecode-generator, 26 mathematical functions and 17 supported base-types including complex and arbitrary MPFR-multiprecision. Both parser and bytecode may run in threads. The usage of ATMSP is most simple - just include a single header in your own code and go. Reasonably experienced coders may implement other base-types like bool, SSE2, rationals or bigint's with a few changes. ...

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.

FFFF is the fastest Win32/OSX/Linux/IRIX Mandelbrot generator. Features OpenGL, realtime zoom, SSE/AltiVec QuadPixel, SSE2/3DNow! DualPixel calc, FPU per pixel calc, GPU asm (Fragment/Vertex) calc, multiprocessor support, and benchmarking. Opt asm code!

neuralnetgen is intended to be a universal neural net generator that receives a neural net description (on Neural Net Description Language, also developed on this project) and generates ANSI C code of a library that implements it.

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.