Search Results for "integer" - Page 15

This project has the aim to offer a highly efficient C++ library for arbitrary-precision integer and decimal arithmetic. Actually an alpha version of the arbitrary-precision-integer-arithmetic-class can be downloaded.

Qopcounter analyzes hardware counter databases to obtain the number of floating point, memory, and integer operations per second as well as related metrics. Qopcounter can collect data for both serial and parallel calculations.

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

Qsoftcounter measures the number of floating point, integer, and memory operations performed during a program\'s execution using software counters. This is accomplished by statically instrumenting a binary using Atom.

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.

HexCalc is a simple calculator similar to GNOME calculator. it can do simple calculations in hexadecimal, octal, binary, and non-floating point decimal. It uses a 32bit signed integer. It is a helpful little coder utility.

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

A GNOME panel applet that can monitor a file and rip an integer or floating point number out of a row/column in that file and display it in a dial or gauge meter in a GNOME panel applet.

An RPN calculator design to manage well with stdin stream of number and operations

These routines compute local densities (at all places) for integer-valued quadratic forms and check representability of all numbers up to a given (multiplicatively defined) bound. These computations produce the explicit (sharp) lower bound for the constant in the asymptotic expression for the "representation numbers" r_Q(m) described in the 2004 Duke Math. Journal paper of Hanke "Local Densities and Explicit Bounds for Representability by a Quadratic Form".

Myfu is a merge of the YAFU and Msieve libraries for integer factorization

"Implement a Caesar cipher, both encoding and decoding. The key is an integer from 1 to 25." The encoding function was published here: (https://rosettacode.org/wiki/Caesar_cipher#Julia)

CubeStorm is a falling Blocks Game - better known as "Tetris". Its a very enhanced version of Tetris, where pieces react physically correct to the Gravity and have a floating point position instead of integer positions in the playfield.

Integer Singular Value Decomposition Genetic Algorithm Function Fitter. This is an optimization algorithm that performs a similar role to a neural network.

Evolutionary computation library and benchmark utility. Integer encoded genetic algorithm.

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.

Kammerjäger is a debugging and testing tool that enables you to prove the correctness of your code. In our C like programming language named "SimPL" you can easily and simply annotate your code with preconditions and assertions (also with forall and exists expressions). We then use Microsofts Z3 theorem prover to prove if the behaviour of your program matches what you expected. The easy to use GUI with an integrated Interpreter and Debugger (with a Stackview and HotCodeReplacement) makes...