Search Results for "integer" - Page 3

Specter - Abstract Arithmetics Library (AAL) is a library coded in native C which is able to do operations with numbers of virtually unlimited length. Specter is targeting mainly cryptography and big integer maths though.

Large Integer Calculator. Includes most arithmetic functions plus named memory values.

Big Integer Calculator with a simple micro controller (AVR MEGA32). 100 Digits now but soon it will go further long!

Java ILP is a simple java interface to (mixed) integer linear programming solvers such as lp_solve, Glpk, Gurobi, SAT4J (0-1 ILP), MiniSat+(0-1 ILP), CPLEX, or Mosek. (documentation at http://javailp.sourceforge.net/)

LameUtils contails LameInts (large integer numbers signed and unsigned), LameStrings, and LameArray.

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.)

C++ large integer class with Boost License.

Found various fixed point and integer in C#; working on coalescing them into a C# library.

Graph polynomials and view prime numbers on a ulam spiral graphing plot. Only integer numbers. Based on an old GPL version of the JEP equation parser. See website for additional examples/live applets Seems to be closely related to Cellular automaton.

BCAR is a library for the associative classification, which denotes "Boosting Class Association Rules". BCAR provides a general tool for classification tasks with various types of input data.

Datamixer generates mock data values for various datatypes, including integer, floating precision, datetime, and string. It can generate complex sequences, based on functions and permutations of the basic data series.

Many computational problems need arithmetic operations in polynomial finite rings over Z/nZ, where n is an integer (n>1). This library provides efficient operations for applications such as integer factorization and primality testing.

MpNT is a multi-precision number theory library that provides a base for building cryptographic applications. It may however be used in any domain where efficient integer, modular, and floating-point computations involving large numbers are required.

Seqsee is a program that extends integer pattern sequences in a human like way.

This is a collection of vb class modules written in native Visual Basic. They provide the following functionality: Processing of very large integer numbers, hashing algorithms, prime number handling and an implementation of the RSA algorithm.

MFFM MTC - a type II signal filter and C++ heirachy which controls and describes time code in two modes, INTEGER and DIGIT mode. INTEGER mode for math. manip. (+, -, *, /, etc.). DIGIT mode allows manip. of time digits (0:19:59 -> 0:20:09 click on tens)

LinProg.NET is a framework for mathematical programming, supporting linear, integer, boolean and quadratic programming.

This is a library of classes and functions to be used to abstract arbitrarily large integer and floating-point numbers in C++. All standard operators are overloaded so the user is able to substitute "mpi" for "int" and "mpf" for "double" to use.

XNum is an integer arithmetic library written in C++. The difference between XNum and other libraries such as GMP <http://www.swox.com/gmp/> is the the former tries to imitate the practical method that humans use to do the arithmetic themselves. Current

C++ template classes for Multi-Value Logic support arbitrary precision and user defined Multi-Value Logic types. This library comes with pre-defined data types: integer, boolean, bit, logic, std_logic, bit_vector, logic_vector and std_logic_vector.

MIDP or some KVM implementation don't support float or double type. There is a Java Math Library implement the most math functions in a Parametric Math Fixed Point Package. This package use only integer type.

Rascal, the Advanced Scientific CALculator, is a platform independent modular calculator. Based on modules for integer, doubles, strings, vectors and matrices it can be easily extended with existing C or C++ code.

Algomath is a portable 32bit integer Arithmetic C Library with prime numbers and numbers manipulation algorithms. Optional fast assembly language alternatives (NASM source) for prime numbers time-critical functions are also included for the Intel-x86 rang

Path Partitioner constructs random graph partitions and solves the linear (or integer) programming problems that assign weights to the edges such that the performance ratio of the local search algorithm for the Path Partitioning problem is minimized. See http://www.tau.ac.il/~ohadschn/Thesis/Partitioning.pdf. Requirements: Microsoft Automatic Graph Layout http://research.microsoft.com/en-us/projects/msagl/ Gurobi Optimizer http://www.gurobi.com/ Permutations, Combinations, and Variations using C# Generics http://www.codeproject.com/Articles/26050/Permutations-Combinations-and-Variations-using-C-G

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.