Open Source Algorithms - Page 9
Sort By:
-
Stop Cyber Threats with VM-Series Next-Gen Firewall on AzureGain integrated visibility across all traffic in a single pass. Deploy Palo Alto Networks VM-Series to determine application identity and content while automating security policy updates via rich APIs.
-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
1
-
2
C++ BigInt class
C++ BigInt class enables to work with arbitrary precision integers
C++ BigInt class that enables the user to work with arbitrary precision integers. Latest Version: 10.3 (2019-03-06) -
3
C-squares
Concise spatial query and representation system (c-squares)
C-squares is an easily implemented method for storage, querying and display of spatial data locations, based on a hierarchical, grid-based representation of the Earth' surface. Source code for encoding, decoding, mapping, etc. is provided via this site. Additional support is available by contacting the system developer, Tony.Rees@marinespecies.org; see also the c-squares home page at http://www.cmar.csiro.au/csquares/ . -
4
Concurrency Freaks
A library with Scalable (and fast) Read-Write locks
This library contains Java code for several Read-Write Locks: - ScalableRWLock: A rw-lock that scales with the number of threads doing read-lock. - ScalableRWLockS: Similar to above but different implementation. - ScalableStampedRWLock: An hybrid of the ScalableRWLock and the StampedLock provided in JDK 8, which provides good overall performance. - FAARWLock: Uses a Fetch-And-Add operation for the read-lock which means it is not so scalable as ScalableRWLock but it is still faster than classical implementations -
Go From AI Idea to AI App FastAccess Gemini 3 and 200+ models. Build chatbots, agents, or custom models with built-in monitoring and scaling.
-
5
With this application you will know, instantly the time difference between two dates in the form of date, days, hours, minutes, and seconds!
-
6
Free scripts & examples- JSP, Eclipse, SQL, PHP, ASP, Win32 Batch, Javascript, Flash/Actionscript. -=-=-=-=-=-=- NOTE: This project is closed. For new development related to integrating Beyond Compare with Eclipse, see http://beyondcvs.sourceforge.net/
-
7
We developed a systematic algorithmic solution for quantitative drug sensitivity scoring (DSS), based on continuous modeling and integration of multiple dose-response relationships in high-throughput compound testing studies. License: The DSS R-package is made available under the terms of the GNU General Public License, which means that the source code is freely available for use within other software, but if you alter the code and distribute it, you must make the new source code freely available as well. This software is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY. In case you use the package in your work, we do appreciate a citation to a DSS publication. Citation: Yadav et al. (2014), Quantitative scoring of differential drug sensitivity for individually optimized anticancer therapies. Scientific Reports 4, 5193; DOI:10.1038/srep05193 Please visit the link below for details
-
8
Generic simple and efficient Fast Fourier Transforms (FFT) implementation using policy-based design and template metaprogramming in C++
-
9
Galapagos is a Genetic Algorithm framework written in Java 5 with the intended audience of undergraduates in an Artificial Intelligence class. The goal of Galapagos is usability: a competent student should be able to learn this library in an afternoon.
-
Forever Free Full-Stack Observability | Grafana CloudBuilt on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
-
10
Genetic Algorithm File Fitter, GAFFitter for short, is a tool based on a genetic algorithm (GA) that tries to fit a collection of items, such as files/directories, into as few as possible volumes of a specific size (e.g. CDs or DVDs).
-
11
Math Tools
Provides useful mathematical tools which make your work much easier.
Math Tools provides mathematical tools, allows you to calculate triangle propeties, and find both parametric and algebraic forms of planes. ------ More Tools Will be Added in The Future ------ ------ Translation to english will be completed soon ------ -
12
-
13
OSM Explorer
Basic routing and spatial functions using OpenStreetMap data
A mapping application for OpenStreetMap that renders OSM or MapQuest tiles and does basic routing from a built-in database. The main focus of this project is the development of a high-performance routing engine that can handle a variety of routing and vehicle constraints on demand without additional pre-processing of the road network. An additional goal is the development of a class library centered around a built-in, object-oriented database used for processing and storing OSM map data such that external dependencies (e.g. external database servers) are minimized. -
14
OpenDark is a free simplification of 'dark'. It's the first open BWT-DC compressor, which has a simple code, high speed and compression ratio. And it's waiting for your ideas! :)
-
15
Opt4J
Modular Java framework for meta-heuristic optimization
Opt4J is an open source Java-based framework for evolutionary computation. It contains a set of (multi-objective) optimization algorithms such as evolutionary algorithms (including SPEA2 and NSGA2), differential evolution, particle swarm optimization, and simulated annealing. The benchmarks that are included comprise ZDT, DTLZ, WFG, and the knapsack problem. The goal of Opt4J is to simplify the evolutionary optimization of user-defined problems as well as the implementation of arbitrary meta-heuristic optimization algorithms. For this purpose, Opt4J relies on a module-based implementation and offers a graphical user interface for the configuration as well as a visualization of the optimization process. -
16
PWSLIB3
Password Safe encrypted databases, Java library
Java module to create, read and write Password Safe V3 encrypted databases. The package is a mature offspring from project JPasswords and can be used with Java 1.8. There is an API document available. -
17
PetoronHash-System
PHASH | post-quantum XOF hashing algorithm | C++20
PHASH is a self-contained, dependency-free, post-quantum XOF hashing algorithm implemented in modern C++20. This release delivers the first fully stable production implementation of the PetoronHash-System — a 1600-bit sponge-based hash function with domain separation, extendable output, and deterministic behavior. Key Features No external dependencies — pure C++20 implementation. Extendable Output (XOF) — supports arbitrary output length (256–8192+ bits). Post-quantum oriented design — ARX-based sponge resistant to Grover-type attacks. Context and salt separation — unique hashing domains for each use-case. Optimized performance — ~120–130 MB/s Comprehensive verification — verify_all.sh performs KAT tests, determinism checks, and performance validation. Verification Script: chmod +x verify_all.sh ./verify_all.sh https://github.com/01alekseev/PetoronHash-System Ivan Alekseev | petoron.org -
18
The PvtTable transforms a simple SQL consult into CrossTables not normalized. You can vary relationships between severals lines and columns more: http://en.wikipedia.org/wiki/Crosstab framework compatibility code 1.1Framework used 1.4
-
19
Design and develop Recommendation and Adaptive Prediction Engines to address eCommerce opportunities. Build a portfolio of engines by creating and porting algorithms from multiple disciplines to a usable form. Try to solve NetFlix and other challenges.
-
20
Sorting-Visualizer
A GUI sorting visualizer desktop application
A GUI sorting visualizer desktop application that helps to visualize various sorting algorithms interactively. Visualizer the sorting algorithms like Bubble sort, Insertion sort, Selection sort, Gnome sort, Shaker sort and Odd even sort. Change the bar color and background by customizing. Increase or decrease speed of animation to visualize the sorting process. Download now! -
21
Sudoku
solve Sudoku puzzles as quick as possible
* Requires : .net framework 4.5 or later Sudoku , This application developed using C# and requires .net framework 4.5 or later. GUI supports better good feedback for each and every action. To easy to handle. Save and reuse the Sudoku file , all files are stored as .sdku files ( sudoku files ) and this files are opened only through this application. Use it and rate it ! -
22
TSP Solver and Generator
Generate and solve Travelling Salesman Problem tasks
TSPSG is intended to generate and solve Travelling Salesman Problem (TSP) tasks. It uses Branch and Bound method for solving. An input is a number of cities and a matrix of city-to-city travel prices. The matrix can be populated with random values in a given range (useful for generating tasks). The result is an optimal route, its price, step-by-step matrices of solving and solving graph. The task can be saved in internal binary format and opened later. The result can be printed or saved as PDF, HTML, or ODF. TSPSG may be useful for teachers to generate test tasks or just for regular users to solve TSPs. Also, it may be used as an example of using Branch and Bound method to solve a particular task. -
23
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.
-
24
WM Hyperintensities Segmentation Toolbox
Open Source White Matter Hyperintensities Segmentation Toolbox
Wisconsin White Matter Hyperintensity Segmentation [W2MHS] and Quantification Toolbox is an open source MatLab toolbox designed for detecting and quantifying White Matter Hyperintensities (WMH) in Alzheimer’s and aging related neurological disorders. WMHs arise as bright regions on T2- weighted FLAIR images. They reflect comorbid neural injury or cerebral vascular disease burden. Their precise detection is of interest in Alzheimer’s disease (AD) with regard to its prognosis. Our toolbox provides a self-sufficient set of tools for segmenting these WMHs reliably and further quantifying their burden for down-processing studies. -
25
The C++-programs simulate : Nondeterministic/Deterministic Multitape Turing & Post Machines, Universal Turing Machine, Turing Machine with faults, failures and recovery.
