Search Results for "algorithms"
Sort By:
Showing 4417 open source projects for "algorithms"
View related business solutions-
Gen AI apps are built with MongoDB AtlasMongoDB Atlas is the developer-friendly database used to build, scale, and run gen AI and LLM-powered apps—without needing a separate vector database. Atlas offers built-in vector search, global availability across 115+ regions, and flexible document modeling. Start building AI apps faster, all in one place.
-
Easy-to-Use Website Accessibility WidgetAll in One Accessibility is an AI based accessibility tool that helps organizations to enhance the accessibility and usability of websites quickly.
-
1
Swift Algorithms
Commonly used sequence and collection algorithms for Swift
Swift Algorithms is an open-source package of sequence and collection algorithms, along with their related types. Algorithms are powerful tools for thought because they encapsulate difficult-to-read and error-prone raw loops. The Algorithms package includes a host of powerful, generic algorithms frequently found in other popular programming languages. -
2
The Algorithms Python
All Algorithms implemented in Python
The Algorithms-Python project is a comprehensive collection of Python implementations for a wide range of algorithms and data structures. It serves primarily as an educational resource for learners and developers who want to understand how algorithms work under the hood. Each implementation is designed with clarity in mind, favoring readability and comprehension over performance optimization. -
3
-
4
Navigational Algorithms
Navigational Algorithms - Marine navigation
- Celestial Navigation: Sight Reduction, Line Of Position, Fix... - Positional Astronomy: Nautical Almanac, RA, GHA, Dec - Coastal Navigation: Range, Bering, Horizontal angles, IALA... - Sailings: Rhumbs, Loxodromic, Orthodromic, Meridional parts... - Weather , Tides - Software: PC, Android https://sites.google.com/site/navigationalalgorithms/">
-
Zendesk: The Complete Customer Service SolutionEquip your agents with powerful AI tools and workflows that boost efficiency and elevate customer experiences across every channel.
-
5
CGAL
The Computational Geometry Algorithms Library
CGAL or the Computational Geometry Algorithms Library is a C++ library that gives you easy access to a myriad of efficient and reliable geometric algorithms. These algorithms are useful in a wide range of applications, including computer aided design, robotics, molecular biology, medical imaging, geographic information systems and more. CGAL features a great range of data structures and algorithms, including Voronoi diagrams, cell complexes and polyhedra, triangulations, arrangements of curves, surface and volume mesh generation, spatial searching, alpha shapes, geometry processing, and many more. ... -
6
javascript-algorithms
JavaScript implementations of computer science algorithms
javascript-algorithms is a repository that implements a comprehensive collection of classic data structures and algorithmic solutions in JavaScript — including sorting, searching, graph algorithms, dynamic programming, and more. It serves as a learning and reference resource for developers wanting to understand how standard algorithms can be expressed in JavaScript, bridging the gap between theoretical algorithm knowledge and practical implementation usable in web or Node.js contexts. ... -
7
Hello Algorithm
Animated illustrations, one-click data structure
Animated illustrations, one-click data structure and algorithm tutorials. This project aims to create an open source, free, novice-friendly introductory tutorial on data structures and algorithms. The whole book uses animated illustrations, the content is clear and easy to understand, and the learning curve is smooth, guiding beginners to explore the knowledge map of data structures and algorithms. The source code can be run with one click, helping readers improve their programming skills during exercises and understand the working principles of algorithms and the underlying implementation of data structures. ... -
8
TextDistance
Compute distance between sequences
Python library for comparing the distance between two or more sequences by many algorithms. For main algorithms, text distance try to call known external libraries (fastest first) if available (installed in your system) and possible (this implementation can compare this type of sequences). Install text distance with extras for this feature. Textdistance use benchmark results for algorithm optimization and try to call the fastest external lib first (if possible). -
9
InsightFace
State-of-the-art 2D and 3D Face Analysis Project
...InsightFace is an open-source 2D&3D deep face analysis library. InsightFace is an integrated Python library for 2D&3D face analysis. InsightFace efficiently implements a wide variety of state-of-the-art algorithms for face recognition, face detection, and face alignment, which are optimized for both training and deployment. Research institutes and industrial organizations can get benefits from InsightFace library. -
Comet Backup - Fast, Secure Backup Software for MSPsComet is a flexible backup platform, giving you total control over your backup environment and storage destinations.
-
10
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. -
11
PlatEMO
Evolutionary multi-objective optimization platform
...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. -
12
Zstandard
Zstandard - Fast real-time compression algorithm
...Zstd can trade compression speed for stronger compression ratios. It is configurable by small increment. Decompression speed is preserved and remain roughly the same at all settings, a property shared by most LZ compression algorithms, such as zlib or lzma. -
13
OnlineStats.jl
Single-pass algorithms for statistics
OnlineStats does statistics and data visualization for big/streaming data via online algorithms. High-performance single-pass algorithms for statistics and data viz. Updated one observation at a time. Algorithms use O(1) memory. Algorithms use O(1) memory. -
14
pybaselines
Library of algorithms for baseline correction of experimental data
...These include popular algorithms, such as AsLS, airPLS, ModPoly, and SNIP, as well as many lesser-known algorithms. Most algorithms are adapted directly from literature, although there are a few that are unique to pybaselines, such as penalized spline versions of Whittaker-smoothing-based algorithms. The full list of implemented algorithms can be found in the documentation. -
15
DomainBed
DomainBed is a suite to test domain generalization algorithms
DomainBed is a PyTorch-based research suite created by Facebook Research for benchmarking and evaluating domain generalization algorithms. It provides a unified framework for comparing methods that aim to train models capable of performing well across unseen domains, as introduced in the paper In Search of Lost Domain Generalization. The library includes a wide range of well-known domain generalization algorithms, from classical baselines such as Empirical Risk Minimization (ERM) and Invariant Risk Minimization (IRM) to more advanced techniques like Domain Adversarial Neural Networks (DANN), Adaptive Risk Minimization (ARM), and Invariance Principle Meets Information Bottleneck (IB-ERM/IB-IRM). ... -
16
Manopt.jl
Optimization on Manifolds in Julia
Optimization Algorithm on Riemannian Manifolds. A framework to implement arbitrary optimization algorithms on Riemannian Manifolds. Library of optimization algorithms on Riemannian manifolds. Easy-to-use interface for (debug) output and recording values during an algorithm run. Several tools to investigate the algorithms, gradients, and optimality criteria. -
17
ReinforcementLearning.jl
A reinforcement learning package for Julia
A collection of tools for doing reinforcement learning research in Julia. Provide elaborately designed components and interfaces to help users implement new algorithms. Make it easy for new users to run benchmark experiments, compare different algorithms, and evaluate and diagnose agents. Facilitate reproducibility from traditional tabular methods to modern deep reinforcement learning algorithms. Make it easy for new users to run benchmark experiments, compare different algorithms, and evaluate and diagnose agents. ... -
18
LZ4
Extremely fast compression algorithm
LZ4 is lossless compression algorithm, providing compression speed > 500 MB/s per core (>0.15 Bytes/cycle). It features an extremely fast decoder, with speed in multiple GB/s per core (~1 Byte/cycle). A high compression derivative, called LZ4_HC, is available, trading customizable CPU time for compression ratio. LZ4 library is provided as open-source software using a BSD license. This benchmark simulates simple "static content transfer" scenario such as OS Kernel compression or video game's... -
19
Java JWT
Java implementation of JSON Web Token (JWT)
A Java implementation of JSON Web Token (JWT) - RFC 7519. This library requires Java 8 or higher. The last version that supported Java 7 was 3.11.0. The library implements JWT Verification and Signing using several algorithms. The Algorithm defines how a token is signed and verified. It can be instantiated with the raw value of the secret in the case of HMAC algorithms, or the key pairs or KeyProvider in the case of RSA and ECDSA algorithms. Once created, the instance is reusable for token signing and verification operations. When using RSA or ECDSA algorithms and you just need to sign JWTs you can avoid specifying a Public Key by passing a null value. ... -
20
OpenSpiel
Environments and algorithms for research in general reinforcement
...OpenSpiel also includes tools to analyze learning dynamics and other common evaluation metrics. Games are represented as procedural extensive-form games, with some natural extensions. The core API and games are implemented in C++ and exposed to Python. Algorithms and tools are written both in C++ and Python. To try OpenSpiel in Google Colaboratory, please refer to open_spiel/colabs subdirectory. -
21
LightGBM
Gradient boosting framework based on decision tree algorithms
LightGBM or Light Gradient Boosting Machine is a high-performance, open source gradient boosting framework based on decision tree algorithms. Compared to other boosting frameworks, LightGBM offers several advantages in terms of speed, efficiency and accuracy. Parallel experiments have shown that LightGBM can attain linear speed-up through multiple machines for training in specific settings, all while consuming less memory. LightGBM supports parallel and GPU learning, and can handle large-scale data. ... -
22
ProximalAlgorithms.jl
Proximal algorithms for nonsmooth optimization in Julia
A Julia package for non-smooth optimization algorithms. This package provides algorithms for the minimization of objective functions that include non-smooth terms, such as constraints or non-differentiable penalties. -
23
Swift Algorithm Club
Algorithms and data structures in Swift, with explanations
Swift Algorithm Club is a project that implements a broad collection of algorithms and data structures in the Swift programming language, with clear commentary and educational intent. Its purpose is not primarily to be a utility library, but rather to teach the how and why behind algorithms—readers can study implementations, complexity, and design choices in a Swift context. The repository includes common classic algorithms (sorting, searching, trees, graphs, dynamic programming, etc.) and structures (queues, heaps, tries, balanced trees) along with writeups explaining them. ... -
24
-
25
Perceval
An open source framework for programming photonic quantum computers
...Through a simple object-oriented Python API, Perceval provides tools for composing circuits from linear optical components, defining single-photon sources, manipulating Fock states, running simulations, reproducing published experimental papers and experimenting with a new generation of quantum algorithms. It aims to be a companion tool for developing photonic circuits – for simulating and optimizing their design, modeling both the ideal and realistic behaviors, and proposing a normalized interface to control them through the concept of backends.