Open Source Algorithms - Page 14
Sort By:
Algorithms
View 5732 business solutions-
Monitor your whole IT InfrastructureCaters to tech staff, system Administrators, and companies of any size, from small and medium sized businesses to enterprises that need their IT network to be reliable and easy to monitor in real-time. Equipped with an easy-to-use, intuitive interface with a cutting-edge monitoring engine. PRTG optimizes connections and workloads as well as reducing operational costs by avoiding outages while saving time and controlling service level agreements (SLAs).
-
Cloud data warehouse to power your data-driven innovationBigQuery Studio provides a single, unified interface for all data practitioners of various coding skills to simplify analytics workflows from data ingestion and preparation to data exploration and visualization to ML model creation and use. It also allows you to use simple SQL to access Vertex AI foundational models directly inside BigQuery for text processing tasks, such as sentiment analysis, entity extraction, and many more without having to deal with specialized models.
-
1
TFastDIB consists of a DIB class and units with optimized routines for common graphics tasks like resampling, blending, quantizing & dithering, color space conversions, bit depth conversions, rendering primitives, and a collection of filters and effects.
-
2
VRMosaic for Lazarus
VRMosaic for Lazarus
VRMosaic for Lazarus a sliding cells puzzle game written using Free Pascal for Lazarus [*] now include auto mosaic resolver (Aug 2023) !! includes Lazarus sources & build project another fine SunStorm release Vincent Radio {Adrix.NT} adrixnt@hotmail.it -
3
mstp-lib
RSTP / MSTP Library and Simulator - moved to GitHub
Project moved to GitHub. Check out the description there. https://github.com/adigostin/mstp-lib -
4
-
Find out just how much your login box can do for your customer | Auth0From improving customer experience through seamless sign-on to making MFA as easy as a click of a button – your login box must find the right balance between user convenience, privacy and security.
-
5
ADiV
ADiV is a set of components for LAMW that uses JAVA and Pascal
ADiV is a set of components for LAMW that uses JAVA and Pascal. It stands out for the simplicity of programming, thanks to the use of Pascal and hiding the Java Android code. -
6
A branch-and-prune method to find all solutions to systems of nonlinear equations. The number of variables must equal the number of equations. The variables must have proper lower and upper bounds. The solver has an interface to the AMPL environment.
-
7
This project is a highly flexible implementation of the well known bin packing algortihms: next fit, first fit, best fit, worst fit. The elements and bins may have any number of dimensions.
-
8
CSGraph is a simple graph library. It provides the most popular algorithms to create and manipulate graphs.
-
9
CUSHAW2: Parallel Gapped Read Alignment
One of the leading short-/long-read aligner to large genomes
CUSHAW2 is a fast and parallel gapped read alignment to large genomes, such as the human genome. The performance evaluation, by aligning simulated and real datasets to the human genome, shows that CUSHAW2 is consistently among the highest-ranked aligners in terms of alignment quality for both single-end and paired-end alignment, while demonstrating highly competitive speed. Furthermore, our aligner shows good parallel scalability with respect to the number of CPU threads. -
Run applications fast and securely in a fully managed environmentRun frontend and backend services, batch jobs, deploy websites and applications, and queue processing workloads without the need to manage infrastructure.
-
10
-
11
Celluster is an easy adaptable producer/consumer software for distributed computing on a cluster of Cell B.E. processors
-
12
Fast search using a standard SQL on Oracle or PostgreSQL database. The package includes the database creator, loader and web application. It supports SMILES and SMARTS substructure searches, similarity search, stereochemistry.
-
13
Combinations Algorithm
Documentation and coding for the generation of combinations
This project comprises documentation and VBA programming code in respect of a combinations algorithm that I have written. The algorithm is in the Excel file named Combinations.xlsm and the documentation that explains how to use interface and execution of the algorithm is in the pdf file called Combinations.pdf You will need to enable macros in Excel in order to run the algorithm. -
14
Digraph3
A collection of python3 modules for Algorithmic Decision Theory
This collection of Python3 modules provides a large range of implemented decision aiding algorithms useful in the field of outranking digraphs based Multiple Criteria Decision Aid (MCDA), especially best choice, linear ranking and absolute or relative rating algorithms with multiple incommensurable criteria. Technical documentation and tutorials are available under the following link: https://digraph3.readthedocs.io/en/latest/ The tutorials introduce the main objects like digraphs, outranking digraphs and performance tableaux. There is also a tutorial provided on undirected graphs. Some tutorials are problem oriented and show how to compute the winner of an election, how to build a best choice recommendation, or how to linearly rank or rate with multiple incommensurable performance criteria. Other tutorials concern more specifically operational aspects of computing maximal independent sets (MISs) and kernels in graphs and digraphs. -
15
Elite Planet Browser
Browse through the planets of the Elite game on various Z80 machines
First of all: this program is totally useless. But those of you who know and love the classic computer game "Elite" will maybe like it. The "Elite Planet Browser" is a little program for various classic Z80-based computers, written in C using the z88dk compiler (www.z88dk.org). It allows you to browse through the planet data of the Elite game on many old Z80-based computers. When the original game came out in 1984, many people wondered how it is possible to have detailed data of so many planets in the 16K RAM memory of the BBC Micro. The trick behind this is a clever algorithm based on a pseudo-random number sequence, and this algorithm is reproduced here in this program. Currently, 77 target systems are supported, including Sinclair ZX81, Jupiter Ace, ColecoVision, MSX, Tandy TRS-80, Sharp MZ, and many more. 2025-10-20: - New target supported: Sanyo PHC-25 / Seiko MAP-1010 -
16
A self-contained, fully configurable Java "game" to simulate multi-species evolution. Design species by optionally specifying every attribute; modify any or all environmental settings; let them loose to eat, fight, procreate, die, and Evolve!
-
17
ExRandom
Sampling exactly from the normal and exponential distributions
ExRandom is a small header-only C++11 library for exact sampling from the normal, exponential, and discrete normal distributions (provided that the underlying generator is perfect). This library provides an implementation of the algorithms described in C. F. F. Karney, Sampling exactly from the normal distribution, ACM Trans. Math. Software 42(1), 3:1-14 (Jan. 2016), https://doi.org/10.1145/2710016, https://arxiv.org/abs/1303.6257. -
18
Extensible Compressed Trie
An extensible and compressed trie data structure written in C++.
An extensible and compressed trie data structure written in C++. -
19
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 & finding roots F(x), Fourier series. Old version (v.8.4.17.250): Examples for Delphi, FPC, Builder, MSVC , GCC (Codeblock) , VB6, FreeBasic. Download files: Foreval_all.7z (Foreval v9 + Foreval v8 + ForevalZ + all examples + doc) - recommend ForevalG9.7z (Foreval v9 + examples v9+ doc) (math parser, math expression parser, evaluate formula, evaluator, symbolic, differentiation, derivative , complex) -
20
The C++ library Geneva allows to run large scale parametric optimization problems. It can run in serial or multi-threaded mode or in a networked environment. The library currently covers Evolutionary Strategies, Genetic Algorithms and mixed scenarios.
-
21
This is a cross-platform framework for using Genetic Algorithms for solutions. Written in Java and uses convinient plug-in features for every phase in the genetic development, while maintaining an easy-to-use API for easy integration into applications.
-
22
-
23
-
24
HeuriStitch
An heuristic image stitcher
An heuristic image stitcher made to test Genetic and PSO based algorithms -
25
HungarianAlgorithm
An Ada implementation of the Hungarian Algorithm to minimize cost
The Hungarian algorithm can be described as optimally solving a workers versus jobs assignment problem that minimizes total cost. This implementation assumes a square cost matrix, i.e. the number of jobs equals the number of workers to do them.