Open Source Linux Algorithms - Page 24
Sort By:
Algorithms for Linux
View 1340 business solutions-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
Ship Agents FasterGemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
-
1
A light-weight group communication system/library of distributed algorithms implementations for agreement problems (e.g., Consensus, Unreliable Leader Election and Atomic Broadcast).
-
2
Damerau Levenshtein
Java Library for Damerau Levenshtein Algorithm
-
3
This is an implementation of Donald Knuth's Algorithm X ("dancing links"). This is primarily a sudoku generator and solver, though it can be used to solve other exact cover problems.
-
4
Dantzig-Wolfe Solver
An implementation of Dantzig-Wolfe decomposition built upon GLPK
An implementation of Dantzig-Wolfe decomposition built upon the GNU Linear Programming Kit. This is a command line tool for solving properly decomposed linear programs. There are several examples and some documentation to guide the use of this solver. Forked over to GitHub (see link). -
$300 Free Credits to Build on Google CloudPut your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
-
5
Data Algorithm/leetcode/lintcode
Data Structure and Algorithm notes
This work is some notes of learning and practicing data structures and algorithms. Part I is a brief introduction of basic data structures and algorithms, such as, linked lists, stack, queues, trees, sorting and etc. This book notes about learning data structure and algorithms. It was written in Simplified Chinese but other languages such as English and Traditional Chinese are also working in progress. -
6
DMTL (Data Mining Template Library) - A generic C++ based library for mining structured patterns such as sets, sequences, trees and graphs. The library provides implementation of popular frequent pattern mining algorithms.
-
7
Data Structure Tester is an OCaml application for multiple testing of various data structures (also written in other lanages, like C or C++).It proviedes many examples to test, easily configurable tester and signatures for all data structers to be tested.
-
8
Data Structures and Algorithms in JS
Data Structures and Algorithms explained and implemented in JavaScript
Are you a JavaScript developer looking to improve your craft? Then, this algorithms book is for you. This material contains the fundamental concepts to move your career to the next level. You will be able to solve problems faster in your day-to-day work and ace technical job interviews. Simply put, algorithms are several steps to solve a specific problem (e.g., sort number, search value, transform data, etc.). Algorithms are an essential toolbox for every programmer. Even if you don't realize it, you use them every day. They are built-in in apps, programming languages, and libraries. However, to make use of them properly, you have to know the tradeoffs so you can choose the best tool for the job. Improve your problem-solving skills and become a stronger developer by understanding fundamental computer science concepts. -
9
A verification library accompanied by a simple tool for verification of credit-cards, social security-numbers and other mod(10) and similar checksums in a standard shell-environment from the command-line or as a function. No compilation required.
-
PRTG Catches Network Issues Before They Cause DowntimeReactive troubleshooting usually means hearing about a problem from frustrated users, not your monitoring tool. PRTG sets threshold-based alerts across devices, servers and applications, notifying your team by email, SMS or push the moment a metric crosses a set limit. That means catching a failing disk or overloaded server before it becomes an outage and getting time back from firefighting. Start a free trial and set your first alerts today.
-
10
DataUsagePrinter
Creates printable string of data usage
A simple utility which creates a printable string of data usage. E.g. supply the value 1234567890 and DataUsagePrinter will return the string "1GB 153MB 384KB 722B". Available as binary and source downloads for Java and C#. -
11
For each Date/Time since 1582-Oct-15 (start Gregorian Calendar): ++ add/sub days&hh:mm:ss - considered all leap years; summer time DST ++ compute start/end of DST ++ compute UTC (Greenwich) to local/DST ++ weekdays ++ Excel compatible date value
-
12
-
13
This chess program changes its strength to give the best match against you. Eventually it learns to beat you specifically through learning alogirthms. Features included transposition tables and a elementary 3-piece endgame tablebase.
-
14
DeepSpec
A full-stack codebase for training and evaluating speculative decoding
DeepSpec is a full-stack codebase for training and evaluating draft models used in speculative decoding. It provides the components needed to prepare data, train draft models, and measure acceptance behavior against target models. The workflow starts with data preparation, including prompt download, target answer regeneration, and target cache construction. It then trains a draft model using configuration files for different algorithms and target model setups. The evaluation pipeline measures speculative decoding performance across benchmark tasks such as math, coding, instruction-following, and chat-style datasets. Overall, it is useful for researchers and engineers studying faster language model inference through speculative decoding methods. -
15
This component is an easing animation value calculator. Easing types: BackEaseIn, backEaseOut, BackEaseInOut, BounceEaseIn, BounceEaseOut, CircEaseIn, CircEaseOut, CircEaseInOut, CubicEaseIn, CubicEaseOut, CubicEaseInOut, ElasticEaseIn, ElasticEaseOu
-
16
Depends implements a generic dependency tracker written in C++ and comes with extensive documentation on how to implement a dependency tracker (and, thus, how this one is implemented). It is very simple to use and provides the tools to "roll your own"
-
17
Detectron2
Next-generation platform for object detection and segmentation
Detectron2 is Facebook AI Research's next generation software system that implements state-of-the-art object detection algorithms. It is a ground-up rewrite of the previous version, Detectron, and it originates from maskrcnn-benchmark. It is powered by the PyTorch deep learning framework. Includes more features such as panoptic segmentation, Densepose, Cascade R-CNN, rotated bounding boxes, PointRend, DeepLab, etc. Can be used as a library to support different projects on top of it. We'll open source more research projects in this way. It trains much faster. Models can be exported to TorchScript format or Caffe2 format for deployment. With a new, more modular design, Detectron2 is flexible and extensible, and able to provide fast training on single or multiple GPU servers. Detectron2 includes high-quality implementations of state-of-the-art object detection. -
18
This project is an extended implementation of Knuth's "Dancing Links" algorithm and some use cases (e.g. Sudoku).
-
19
Diagonal
A command line toolki to solve a problem your favorite program defines
Diagonal can be used for: - getting descriptive statistics such as mean/median/mode with your program producing a sample - finding a root of an equation your program defines - calculating a fixed point of a function your program defines - detecting a cycle of a fuction your program defines as well as - decoding a VCDIFF file -
20
DisChoco
DisChoco: Distributed Constraint Reasoning Solver
DisChoco is a Distributed Constraint Reasoning Solver. Several Distributed Constraint Reasoning algorithms are implemented (like ABT, AFC, Adopt, ...). Users may easily implement and test their algorithms with DisChoco. contact: wahbi[at]users[dot]sourceforge[dot]net -
21
Distant Speech Recognition
Beamforming and Speech Recognition Toolkit
BTK contains C++ and Python libraries that implement speech processing and microphone array techniques such as speech feature extraction, speech enhancement, speaker tracking, beamforming, dereverberation and echo cancellation algorithms. The Millennium ASR provides C++ and python libraries for automatic speech recognition. The Millennium ASR implements a weighted finite state transducer (WFST) decoder, training and adaptation methods. These toolkits are meant for facilitating research and development of automatic distant speech recognition. -
22
Distributed Multithread Apriori (DMTA)
A parallel implementation using MPI and OpenMP to Apriori algorithm
DMTA (Distributed Multithreaded Apriori) is a parallel implementation of Apriori algorithm, which exploits the parallelism at the level of threads and processes, seeking to perform load balancing among the cores. Was implemented in C++ language, using the parallelization libraries OpenMP and MPI. The algorithm was generated as a result of a project developed by André Camilo Bolina, under the guidance of teachers Marluce Rodrigues Pereira, Ahmed Ali Abdalla Esmin and Denilson Alves Pereira, in Department of Computer Science at Federal University of Lavras. The results of this project were published in the Revista de Sistemas de Informação da FSMA and is available in http://www.fsma.edu.br/si/edicao11/FSMA_SI_2013_1_Principal_1.html -
23
Dopamine
Framework for prototyping of reinforcement learning algorithms
Dopamine is a research framework for fast prototyping of reinforcement learning algorithms. It aims to fill the need for a small, easily grokked codebase in which users can freely experiment with wild ideas (speculative research). This first version focuses on supporting the state-of-the-art, single-GPU Rainbow agent (Hessel et al., 2018) applied to Atari 2600 game-playing (Bellemare et al., 2013). Specifically, our Rainbow agent implements the three components identified as most important by Hessel et al., n-step Bellman updates, prioritized experience replay, and distributional reinforcement learning. For completeness, we also provide an implementation of DQN (Mnih et al., 2015). For additional details, please see our documentation. We provide a set of Colaboratory notebooks which demonstrate how to use Dopamine. We provide a website which displays the learning curves for all the provided agents, on all the games. -
24
DualPipe
A bidirectional pipeline parallelism algorithm
DualPipe is a bidirectional pipeline parallelism algorithm open-sourced by DeepSeek, introduced in their DeepSeek-V3 technical framework. The main goal of DualPipe is to maximize overlap between computation and communication phases during distributed training, thus reducing idle GPU time (i.e. “pipeline bubbles”) and improving cluster efficiency. Traditional pipeline parallelism methods (e.g. 1F1B or staggered pipelining) leave gaps because forward and backward phases can’t fully overlap with communication. DualPipe addresses that by scheduling micro-batches from both ends of the pipeline in a bidirectional fashion—i.e. some micro-batches flow forward while others flow backward—so that computation on one partition can coincide with communication for another. -
25
DuranDuranbot
Teachable/trainable artificially intelligent music bot
A teachable/trainable artificially intelligent music bot fundamentally inspired by how the new wave band Duran Duran composes music. This program utilizes many algorithmic/AI techniques/processes, including machine learning; which allow you to teach/train it to compose music which you prefer... and the technique which is the foundation of the design of DuranDuranbot, which was directly inspired by how Duran Duran writes music........ Called, "bit by bit circular composition"....... and it's explanation can be found here - https://scsynth.org/t/bit-by-bit-circular-composition/1107 This program is written in the SuperCollider programming language - https://en.wikipedia.org/wiki/SuperCollider Contact - ken_brant@ymail.com
