Open Source Ada Algorithms
Sort By:
Ada Algorithms
View 6282 business solutionsBrowse free open source Ada Algorithms and projects below. Use the toggles on the left to filter open source Ada Algorithms by OS, license, language, programming language, and project status.
-
Build Data Resilience - Take the Assessment TodayIs your recovery strategy as strong as you think? Take this quick self-assessment to check your recovery readiness and gain tailored insights. In only 2 minutes, you'll learn where you fall on the recovery readiness scale.
-
Paessler: Easy to Use With Enterprise Power. Free TrialYou shouldn't have to choose between a monitoring tool that's easy to use and one that's powerful enough for a complex environment. PRTG's low-code interface lets any admin build dashboards, set alerts and monitor devices without scripting, while custom sensors and full API access are there when your team needs deeper control. One platform, no compromise. Download a free 30-day trial now.
-
1
hbox
Sokoban solver written in Ada
This is a commandline-terminal sokoban solver written in Ada. It is "generic" in the sense that it contains no domain specific strategies. It also provides a demonstration of the incredible power of the Hungarian Algorithm. The proper command to extract the archive and maintain the directory structure is "7z x filename". -
2
paraffin
Iterative and recursive parallelism generics for Ada 2005 and Ada 2012
A suite of Ada 2012 generics to facilitate iterative and recursive parallelism for multicore systems and provide safer recursion for single and multicore systems. Generics include Ravenscar compatible versions for real-time systems. Also Includes paraffinalia, which is a set of useful generics for parallel quicksort, fast fourier transform, function integration, prefix sum, and Red-Black trees -
3
This is an Ada implementation of the Dancing Links X Algorithm as in Donald E. Knuth paper. AdaDLX is used to solve the Eight-Queens puzzle, Sudoku grids and Blocs in Box puzzle.
-
4
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. -
Train ML Models With SQL You Already KnowBuild and deploy ML models using familiar SQL. Automate data prep with built-in Gemini. Query 1 TB and store 10 GB free monthly.
-
5
Ada framework providing work sharing/seeking services for distributing work amongst CPU cores on multi-core machines.
- Previous
- You're on page 1
- Next
