Search Results for "integer"
Sort By:
Showing 29 open source projects for "integer"
View related business solutions-
Outgrown Windows Task Scheduler?Windows Task Scheduler wasn't built for complex, cross-platform automation. Get a free diagnostic that shows exactly where things are failing and provides remediation recommendations. Interactive HTML report delivered in minutes.
-
AI-generated apps that pass security reviewRetool lets you generate dashboards, admin panels, and workflows directly on your data. Type something like “Build me a revenue dashboard on my Stripe data” and get a working app with security, permissions, and compliance built in from day one. Whether on our cloud or self-hosted, create the internal software your team needs without compromising enterprise standards or control.
-
1
Foreval
Foreval is parser & compiler of mathematical expressions
Foreval is compiler of mathematical expressions (formulas) (directly to x86-32 CPU/FPU comand) given as string at run-time. Present as "dll" library and Delphi sources. Can be compiled in FPC (Lazarus). Can be direct connection to the program (without dll). Сurrent version ( v. 9.1.1.393): Examples for Delphi, Lazarus , GCC (Codeblock), (Builder, MSVC - in b.366). Demo: Fractals Julia; Visualizing of functions of complex variable - complex domain coloring , graph plotting... -
2
forevalz
ForevalZ - compiler of mathematical expressions with complex numbers
ForevalZ - compiler of mathematical expressions(formulas) with support of complex numbers (directly to CPU/FPU x86-32 comand) given as string at 'run-time'. (dll library and delphi component). Can be compiled in FPC (Lazarus). Examples for Delphi (2009), FPC , C++(Builder(2009), MSVC(2010), GCC (Codeblock)), VB.NET, VB6, FreeBasic. Demo: Fractals Julia; Visualizing of functions of complex variable - complex domain coloring . (math parser, math expression parser, evaluate formula,... -
3
CountBitsSet
minimal benchmark code for Counting Set Bits (ones) in an Integer
I was curious how much better the Algorithms, pointed out by BitTwiddling Hacks, perform than a simple Lookup Table approach... Now I think, perhaps my little investigation is interesting for others too... PS: the parallel counting Algo is about 35% faster on average on my computers than a simple LUT based solution. Also this shows nicely how different a human brain compatible solution is to a binary machine optimal solution :-) In the meantime I added other Algorithms beside... -
4
lpsolve
Mixed Integer Linear Programming (MILP) solver.
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/ -
Atera all-in-one platform IT management software with AI agentsAtera’s AI agents don’t just assist, they act. From detection to resolution, they handle incidents and requests instantly, taking your IT management from automated to autonomous.
-
5
Base62 Encode/Decode Utility
A tool for encoding/decoding to base62
the package chewingum contains two main programs: - base62 - chew They have been implemented in perl. Base62 has been coded in c++ too. chew has been written to shorten long decimal integer numbers into base62 strings. It's not a mere base conversion, because it doesn't use arithmetic inside its logic. In this way it can convert very long numbers into strings quickly, without overflows. For example if I want to share an id using an url, this will make the url shorter. the base62 program has been written to encode/decode files into this format. ... -
6
-
7
NOMAD is a C++ code that implements the MADS algorithm (Mesh Adaptive Direct Search) for difficult blackbox optimization problems. Such problems occur when the functions to optimize are costly computer simulations with no derivatives.
-
8
Javascript Clipper
Boolean operations and offsetting library in Javascript
The Javascript Clipper library performs clipping and offsetting for both lines and polygons. All four boolean clipping operations are supported - intersection, union, difference and exclusive-or. Polygons can be of any shape including self-intersecting polygons. Javascript Clipper is a port of Angus Johnson's Clipper library: https://sourceforge.net/projects/polyclipping LIVE DEMO: http://jsclipper.sourceforge.net/6.4.2.2/main_demo.html LIVE DEMO... -
9
Arageli is a C++ library for computations in arithmetic, algebra, geometry, linear and integer linear programming. Arageli provides routines and classes that support precise, i.e. symbolic or algebraic, computations.
-
Incredable is the first DLT-secured platform that allows you to save time, eliminate errors, and ensure your organization is compliant all in one place.Incredable streamlines and simplifies the complex process of medical credentialing for hospitals and medical facilities, helping you save valuable time, reduce costs, and minimize risks. With Incredable, you can effortlessly manage all your healthcare providers and their credentials within a single, unified platform. Our state-of-the-art technology ensures top-notch data security, giving you peace of mind.
-
10
Bat2015
Bachelor of Science (Informatik)
The toolkit glpk supports methods for mixed integer linear programming (MILP). These methods solve Capital Budgeting Problems (CBP). Unfortunately, glpk does not support any multithreading and there is no feature to distribute problems via network connections. Today, this is a pitiable sight, because modern computer systems are coupled by networks and support multi threading. We create a distributed system with Apache thrift and the C-API of glpk. -
11
intzip
Fast compression of integer sets.
IntZip is a lossless compression algorithm for strictly increasing lists of unsigned integers. Compression means that a suitable list of integers can be encoded to a (whenever possible) shorter list of the same integer format. An arbitrary set of integers (i.e., a collection of unique numbers where the order does not matter) may be transformed into suitable input data by way of translation and sorting. The main focus of the algorithm is to encode structural characteristics of a given list, such as coherent intervals and repeated distances. ... -
12
FFT for ARMv6
Fixed point 16/32 integer FFT library for the Raspberry Pi and Android
This library is being created as I have a need to do very fast FFTs on low end devices not supporting the NEON instruction set. The Raspberry Pi is an ideal candidate for developing in gcc before porting to JNI for low spec Android devices, hence it's inclusion. Fixed point 16/32 integer FFT library suitable for the Raspberry Pi and Android devices. Includes test stubs for gcc on the Raspberry Pi and a Basic4Android wrapper from JNI. It includes hand optimised ARMv6 assembler, demonstrating techniques such as pipeline stuffing to achieve maximum performance. It also demonstrates how to include large chunks of assembler inline with C/C++ thus avoiding ABI issues between platforms. -
13
Prime-Number-Finder
Prime Number Finder usign Sieve of Eratosthenes
Program by: Ravi Sharma (rvisharma) Prime-Number-Finder-using-Sieve-of-Eratosthenes =============================================== Finds Prime Numbers using Sieve of Eratosthenes Algorithm This Program gives you the prime number upto N Integers, Sieve of Eratosthenes Algorithm is used to determine the Prime Number To find the Prime Number, in the console Shell call the prime_finder(N) function, prime number will be given upto N integer. At first you will be prompted with an input, after that you can call it using function prime_finder(n) example call: >>>prime_finder(10) #output [2,3,5,7] (Int) -> (list) -
14
Linear Program Solver
Solve linear programming problems
Linear Program Solver (LiPS) is an optimization package oriented on solving linear, integer and goal programming problems. The main features of LiPS are: ● LiPS is based on the efficient implementation of the modified simplex method that solves large scale problems. ● LiPS provides not just an answer, but a detailed solution process as a sequence of simplex tables, so you can use it for studying/teaching linear programming -
15
A bignum library written in the C++ programming language as templates. It provides standard mathematical operations like add, sub, mul, div, pow etc. with the big integer and big floating point numbers.
-
16
makingMazes
Creator of mazes, with a recursive algorithm homemade (I'm not mathema
The algorithm will carving zeros in an integer array initialized to "1". Data can be recorded in a simple way. -
17
This is a series of *.java Classes for making programming tasks simpler, much like Apache Commons. Included in this src package is an Advanced Randomizer, TStringList Clone From Delphi, an Algorithem Class, and Method MultiTask Better than Runnables.
-
18
FPM - Fixed Point Math substitutes expensive floating point operations by much cheaper integer arithmetics. Use this library in your plain C (gcc) projects if you like.
-
19
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.)
-
20
Generic toolbox of Particle Swarm Optimization developed in Scilab (PSOTS). It is developed for a variety of complex problems, including single and multi-objective optimization problems, continuous and discrete problems, and mixed integer problems.
-
21
Spreadsort is a fast general-case in-place hybrid radix/comparison algorithm, which tends to be roughly twice as fast as std::sort. This library has calls to sort integers, floats, or strings, or other data types based upon integer, float, or string keys
-
22
natural sort / order of arrays, sorts integer, string and mixed arrays - also strings with numbers included will be ordered naturaly, natsort and natcasesort for javascript
-
23
XNC - Extreme Numeric Compression is used to store integer or floating-point numbers in compressed, binary form. Use XNC to persist high volume scientific or plant monitoring data. Compression ratios of >15 x can be achieved over plain text formats.
-
24
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.
-
25
TextDiff.NET is the .NET component to list differences between two integer arrays using a "longest common subsequence" algorithm. Typically, this component is used to diff 2 text files once their individuals lines have been hashed.
