Search Results for "big integer library" - Page 6

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.

It's library writted in the dotnetframework 2 that gets the bits of character in a integer array and let the user to handle them

Smart Feedback is a simple utility to help developers get feedback on their products An application feedback form and a Delphi Component Editor are provided Simple to use, small in size, big on purpose. Supports sourceforge.net/tracker

Libsssd is a cross-platform, integer-based audio library designed for interactive applications and games on small devices such as smartphones/PDAs. Libsssd currently supports Linux (OSS, ESD), Win32, WinCE Intent/AmigaDE (hosted), and Symbian S60.

The Simple Development Library provides a framework for good software engineering in medium to big projects developed in the Tcl language.

This is a small project to handle big-size variable. A variable will be allocated and free automatically (when task finish). I have no much idea for this. if you have any new idea for this problem, please tell, I will think to develop it for more feature

CLearSharp is a clean C#-implementation of Common Lisp. The big goals are ANSI standard compliance, interoperability with Java and integration with scripting environments. This project is meant to be a sibling to CLearJ, with sharing of implementation.

CLearJ is a clean Java-implementation of Common Lisp. The big goals are ANSI standard compliance, interoperability with Java and integration with scripting environments. This project is meant to be a sibling to CLearSharp, with sharing of implementation.

Java arbitrary-precision calculator and expression parser. "Compiles" text equations into functors to be executed using the Java BigDecimal class.

Multiprecision unsigned number template library (MUNTL). The program is intended for the organization of calculations with the big precision for unsigned numbers. Program is very fast because do not use any heap call (new, malloc etc.)

Converter from DOS-exe (MZ format) files to ROM-able (*.rom format), suitable for loading to absolute addresses. Can be used for create BIOS extenders for I/O card and another soft for x86-based embedded systems for big length files (more, than 64K).

CVPFrameWork is a complete framework solution for PHP developers based on objectual modeling in PHP5. Includes complete set of Native Classes (like String, Integer, Vector...), Sockets, XML-RPC communication, exception handling and much more.

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.

Daemon4J is a helpful ghost for those who - dont like Java startup speed, esp. when the actual program needs only a second - dont know the classpath to use - want to hide Java behind an innocent command line tool - are not ready for the Big Serve

Structure Doctor is a little utility that goes through Java source code and finds possible structural flaws, such as too big methods, duplicate code, duplicate class hierarchies etc... Flaw reports are generated in HTML.

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

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

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.