Open Source Algorithms - Page 4
Sort By:
Algorithms
View 5732 business solutions-
Relax: PRTG Monitors Your IT for YouYou’re the go-to IT person, always putting out fires and keeping things running. With PRTG, you get reliable alerts to monitor your entire IT infrastructure, without the noise. Our intuitive setup gives you a clear overview of your network, devices, and applications in real time. Get instant alerts only when something needs your attention, whether you’re at your desk or on the move. Spend less time worrying about outages and more time focusing on what matters. Set up PRTG once and let it work for you - PRTG has you covered.
-
OpManager the network monitoring software used by over 1 million IT adminsManageEngine OpManager is a powerful network monitoring software that provides deep visibility into the performance of your routers, switches, firewalls, load balancers, wireless LAN controllers, servers, VMs, printers, and storage devices. It is an easy-to-use and affordable network monitoring solution that allows you to drill down to the root cause of an issue and eliminate it.
-
1
LinAsm
Collection of fast and optimized assembly libraries for x86-64 Linux
LinAsm is collection of very fast and SIMD optimized assembly written libraries for x86-64 Linux. It implements many common and widely used algorithms for array manipulations: searching, sorting, arithmetic and vector operations, unit conversions; fast mathematical and statistic functions; numbers and time converting algorithms; finite impulse response (FIR) digital filters; spectrum analysis algorithms, Fast Hartley transformation; CPU cache friendly functions and extremely fast abstract data types (ADT) such as hash tables b-trees, and much more. LinAsm libraries are written on FASM assembly language. They are stable and have appropriate benchmarks for many units. All libraries are well documented and grouped by their functionality. To get more information about this library, please visit the official web site: http://linasm.sourceforge.net -
2
Nokia flash tools
Nokia flashing tools
nokia flashing tools make using hands and lack resolved problem the design prevent virus and malware in nokia phones nokia flashing tool only using fastboot mode -
3
Baselines
High-quality implementations of reinforcement learning algorithms
Unlike the other two, openai/baselines is not currently a maintained or prominent repo in the OpenAI organization (and I found no strong reference in OpenAI’s main GitHub). Historically, “baselines” repositories are often used for baseline implementations of reinforcement learning algorithms or reference models (e.g. in the RL domain). If there was an OpenAI “baselines” repo, it might have contained reference implementations for reinforcement learning or model policy baselines to compare new work against. However, I couldn’t locate an active “openai/baselines” in the latest OpenAI repos, so it may have been archived, removed, or merged into other projects. If you meant a different “baselines” (e.g. OpenAI Baselines for reinforcement learning), I can look up that specific one. -
4
CryptoSwift
Collection of standard and secure cryptographic algorithms
The master branch follows the latest currently released version of Swift. If you need an earlier version for an older version of Swift, you can specify its version in your Podfile or use the code on the branch for that version. Older branches are unsupported. Swift Package Manager uses debug configuration for debug Xcode build, that may result in significant (up to x10000) worse performance. Performance characteristic is different in Release build. XCFrameworks require Xcode 11 or later and they can be integrated similarly to how we’re used to integrating the .framework format. Embedded frameworks require a minimum deployment target of iOS 9 or macOS Sierra (10.12). CryptoSwift uses array of bytes aka Array<UInt8> as a base type for all operations. Every data may be converted to a stream of bytes. You will find convenience functions that accept String or Data, and it will be internally converted to the array of bytes. -
Cloud-based observability solution that helps businesses track and manage workload and performance on a unified dashboard.Monitor everything you run in your cloud without compromising on cost, granularity, or scale. groundcover is a full stack cloud-native APM platform designed to make observability effortless so that you can focus on building world-class products. By leveraging our proprietary sensor, groundcover unlocks unprecedented granularity on all your applications, eliminating the need for costly code changes and development cycles to ensure monitoring continuity.
-
5
Delaunator
Fast JavaScript library for Delaunay triangulation of 2D points
Delaunator is a fast library for Delaunay triangulation. It takes as input a set of points. The triangulation is represented as compact arrays of integers. It’s less convenient than other representations but is the reason the library is fast. After constructing a delaunay = Delaunator.from(points) object, it will have a triangles array and a halfedges array, both indexed by half-edge id. What’s a half-edge? A triangle edge may be shared with another triangle. Instead of thinking about each edge A↔︎B, we will use two half-edges A→B and B→A. Having two half-edges is the key to everything this library provides. It will also be useful to have some helper functions to go from one half-edge to the next and previous half-edges in the same triangle. We can draw all the triangle edges without constructing the triangles themselves. -
6
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. -
7
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. -
8
Grey Wolf Optimizer for Path Planning
Grey Wolf Optimizer (GWO) path planning/trajectory
The Grey Wolf Optimizer for Path Planning is a MATLAB-based implementation of the Grey Wolf Optimizer (GWO) algorithm designed for UAV path and trajectory planning. It allows simulation of both two-dimensional and three-dimensional UAV trajectory planning depending on parameter setups. The tool provides built-in functions to configure different UAV environments and supports multiple optimization objectives. It includes progress visualization to help monitor the optimization process during simulations. Users can adjust objective function weights and experiment with multiple heuristic search strategies to explore optimal solutions. This project demonstrates applications in multi-agent and multi-UAV cooperative path planning, making it useful for research and educational purposes in the field of intelligent optimization and robotics. -
9
Kalman and Bayesian Filters in Python
Kalman Filter book using Jupyter Notebook
Kalman Filter book using Jupyter Notebook. Focuses on building intuition and experience, not formal proofs. Includes Kalman filters,extended Kalman filters, unscented Kalman filters, particle filters, and more. All exercises include solutions. Introductory text for Kalman and Bayesian filters. All code is written in Python, and the book itself is written using Juptyer Notebook so that you can run and modify the code in your browser. What better way to learn? This book teaches you how to solve all sorts of filtering problems. Use many different algorithms, all based on Bayesian probability. In simple terms Bayesian probability determines what is likely to be true based on past information. This book is interactive. While you can read it online as static content, it's better to use it as intended. It is written using Jupyter Notebook, which allows you to combine text, math, Python, and Python output in one place. -
Monitoring, Securing, Optimizing 3rd party scriptsc/side is crawling many sites to get ahead of new attacks. c/side is the only fully autonomous detection tool for assessing 3rd party scripts. We do not rely purely on threat feed intel or easy to circumvent detections. We also use historical context and AI to review the payload and behavior of scripts.
-
10
MADDPG
Code for the MADDPG algorithm from a paper
MADDPG (Multi-Agent Deep Deterministic Policy Gradient) is the official code release from OpenAI’s paper Multi-Agent Actor-Critic for Mixed Cooperative-Competitive Environments. The repository implements a multi-agent reinforcement learning algorithm that extends DDPG to scenarios where multiple agents interact in shared environments. Each agent has its own policy, but training uses centralized critics conditioned on the observations and actions of all agents, enabling learning in cooperative, competitive, and mixed settings. The code is built on top of TensorFlow and integrates with the Multiagent Particle Environments (MPE) for benchmarking. Researchers can use it to reproduce the experiments presented in the paper, which demonstrate how agents learn behaviors such as coordination, competition, and communication. Although archived, MADDPG remains a widely cited baseline in multi-agent reinforcement learning research and has inspired further algorithmic developments. -
11
Machine Learning Octave
MatLab/Octave examples of popular machine learning algorithms
This repository contains MATLAB / Octave implementations of popular machine learning algorithms, along with explanatory code and mathematical derivations, intended as educational material rather than production code. Implementations of supervised learning algorithms (linear regression, logistic regression, neural nets). The author’s goal is to help users understand how each algorithm works “from scratch,” avoiding black-box library calls. Code written so as to expose and comment on mathematical steps. The repository includes clustering, regression, classification, neural networks, anomaly detection, and other standard ML topics. Does not rely heavily on specialized toolboxes or library shortcuts. -
12
PlatEMO
Evolutionary multi-objective optimization platform
Evolutionary multi-objective optimization platform. PlatEMO consists of a number of MATLAB functions without using any other libraries. Any machines able to run MATLAB can use PlatEMO regardless of the operating system. PlatEMO includes more than ninety existing popular MOEAs, including genetic algorithm, differential evolution, particle swarm optimization, memetic algorithm, estimation of distribution algorithm, and surrogate model-based algorithm. Most of them are representative algorithms published in top journals after 2010. Users can select various figures to be displayed, including the Pareto front of the result, the Pareto set of the result, the true Pareto front, and the evolutionary trajectories of any performance indicator values. PlatEMO provides a powerful and friendly GUI, where users can configure all the settings and perform experiments in parallel via the GUI without writing any code. -
13
Smart Algorithm
Repository implementing a variety of intelligent algorithms
Smart-Algorithm is a repository implementing a variety of intelligent / metaheuristic optimization algorithms (e.g. Genetic Algorithm, Ant Colony, Particle Swarm, Immune Algorithm). The implementations are provided in multiple languages (Java, Python, MATLAB). The repository’s aim is to offer reference implementations of “smart” algorithms for tasks like route planning, optimization, or algorithm learning. Particle Swarm Optimization (PSO) implementations in multiple languages. Immune Algorithm (or immune-inspired optimization) implementations. Multiple versions/language compatibility (Java, Python, MATLAB). -
14
Supervised Reptile
Code for the paper "On First-Order Meta-Learning Algorithms"
The supervised-reptile repository contains code associated with the paper “On First-Order Meta-Learning Algorithms”, which introduces Reptile, a meta-learning algorithm for learning model parameter initializations that adapt quickly to new tasks. The implementation here is aimed at supervised few-shot learning settings (e.g. Omniglot, Mini-ImageNet), not reinforcement learning, and includes scripts to run training and evaluation for few-shot classification. The fundamental idea is: sample a task, train on that task (inner loop), and then move the initialization parameters toward the adapted parameters (outer loop). Because Reptile is a first-order algorithm, it avoids computing second derivatives or full meta-gradients, making it computationally simpler while retaining good performance. The repo includes training scripts, dataset fetchers (Omniglot, Mini-ImageNet), and modules for defining the Reptile update logic, variables, and hyperparameters. -
15
interactive-coding-challenges
120+ interactive Python coding interview challenges
Interactive Coding Challenges is a collection of practice problems designed to strengthen data structures, algorithms, and problem-solving skills. The repository emphasizes a learn-by-doing approach: you read a prompt, attempt a solution, and verify behavior with tests, often within notebooks or scripts. Problems span arrays, strings, stacks, queues, linked lists, trees, graphs, dynamic programming, and more, mirroring common interview themes. Many challenges include hints and reference solutions so you can compare approaches and learn idiomatic patterns. The structure encourages incremental improvement—start with a brute-force idea, then refine to optimal time and space complexity. It serves both as a self-study path and as a warm-up bank for interview prep or coding katas. -
16
supercluster
A very fast geospatial point clustering library for browsers and Node
A very fast JavaScript library for geospatial point clustering for browsers and Node. supercluster supports property aggregation with the following two options. Map, a function that returns cluster properties corresponding to a single point. Reduce, a reduce function that merges properties of two clusters into one. -
17
La suite logicielle Monia est destinée à l'apprentissage de l'algorithmique en français. Elle permet de fabriquer un exécutable à partir d'un organigramme, en passant par un programme procédural écrit en pseudo-langage.
">
-
18
FRODO 2
Open-Source Framework for Distributed Constraint Optimization (DCOP)
FRODO is a Java platform to solve Distributed Constraint Satisfaction Problems (DisCSPs) and Optimization Problems (DCOPs). It provides implementations for a variety of algorithms, including DPOP (and its variants), ADOPT, SynchBB, DSA... -
19
-
20
Linear Program Solver (Solvexo) is an optimization package intended for solving linear programming problems. The main features of the Solvexo are: · Solvexo solver is based on the efficient implementation of the simplex method (one or two phases); · Solvexo provides not only an answer, but a detailed solution process as a sequence of simplex matrices, so you can use it in studying (teaching) linear programming. · Solvexo provides a solution with the graphic method for problems with tow variables. · This updated version includes two languages English and French. If you have any questions, feel free to contact me: romdhani.mohamed.ali@gmail.com. Any comments and suggestions would be helpful!
-
21
Temporal Inference Engine
A real time inference engine for temporal logical specifications
A real time inference engine for temporal logical specifications, which is able to acquire, process and generate any binary or real signal through POSIX IPC, files or UNIX sockets. Specifications of signals and dynamic systems are represented as special graphs and executed in real time, with a predictable sampling time of few milliseconds. Real time signal processing, dynamic system control, state machine modeling and logical property verification are some fields of application of this software. The accepted language provides timed logic and mathematical operators, conditional operators, interval operators, bounded quantifiers and parametrization of signals. -
22
devFlowCharter is a complete environment for creating program flowchart, source code generation, and compilation. Its main goal is to be straightforward, educational tool for use during procedural programming classes.
-
23
Continuation Core and Toolboxes (COCO)
Toolboxes for parameter continuation and bifurcation analysis.
Development platform and toolboxes for parameter continuation, e.g., bifurcation analysis of dynamical systems and constrained design optimization. This material is based upon work partially supported by the National Science Foundation under Grant No. 1016467 and the Danish research council (FTP) under the project number 0602-00753B. Any opinions, findings, and conclusions or recommendations expressed on this site are those of the authors and do not necessarily reflect the views of the National Science Foundation or other funding sources. Documentation and tutorials are available for the following toolboxes: * ep : continuation and bifurcations of equilibrium points * coll : continuation of constrained collections of trajectory segments, including multi-segment boundary-value problems * po : continuation and bifurcations of periodic orbits in smooth and hybrid systems * recipes : collection of examples from the book Recipes for Continuation -
24
MultiFast
Mass String Search and Replace Solution via Aho-Corasick Algorithm
Multifast provides you with efficient library and tool, to search and manipulate data streams on the fly. It can search for a huge number of strings and replace them in one pass. It contains a tidy and efficient implementation of the Aho-Corasick algorithm as a C library. -
25
CloudI is an open-source private cloud computing framework for efficient, secure, and internal data processing. CloudI provides scaling for previously unscalable source code with efficient fault-tolerant execution of ATS, C/C++, Erlang/Elixir, Go, Haskell, Java, JavaScript/node.js, OCaml, Perl, PHP, Python, Ruby, or Rust services. The bare essentials for efficient fault-tolerant processing on a cloud!