Search Results for "algorithm" - Page 4
Sort By:
Showing 439 open source projects for "algorithm"
View related business solutions-
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.
-
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
1
Instagram CLI
Become a 10x Instagrammer and Escape Brainrot with Instagram CLI
...We all know the cycle — and we finally had enough. What if Instagram had a quick fix? A productivity-friendly mode that keeps your connections, but gives your attention span a fighting chance? No algorithm traps. No reel vortex. No dopamine casino. Just conversations and updates, on your terms. Instagram CLI is a minimal, fast, keyboard-native way to stay connected without getting cooked by social media. -
2
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). -
3
Bandicoot
fast C++ library for GPU linear algebra & scientific computing
* Fast GPU linear algebra library (matrix maths) for the C++ language, aiming towards a good balance between speed and ease of use * Provides high-level syntax and functionality deliberately similar to Matlab * Provides an API that is aiming to be compatible with Armadillo for easy transition between CPU and GPU linear algebra code * Useful for algorithm development directly in C++, or quick conversion of research code into production environments * Distributed under the permissive Apache 2.0 license, useful for both open-source and proprietary (closed-source) software * Can be used for machine learning, pattern recognition, computer vision, signal processing, bioinformatics, statistics, finance, etc * Downloads: http://coot.sourceforge.io/download.html * Documentation: http://coot.sourceforge.io/docs.html * Bug reports: http://coot.sourceforge.io/faq.html * Git repo: https://gitlab.com/conradsnicta/bandicoot-code -
4
Hypercube
Graph visualizing tool
Hypercube is a tool for visualizing DOT (graphviz), GML, GraphML, GXL and simple text-based graph representations as SVG and EPS images. Hypercube comes with a Qt based GUI application and a Qt-independent command-line tool. It uses a simulated annealing algorithm to lay out the graph, that can be easily parameterized to achieve the desired look. The main development goals are portability and easy usage rather than high performance and complexity. -
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
5
[OFFICIAL] tinyfiledialogs C C++ v3.21.3
inputbox password WIN OSX GTK QT Console VCPKG C# Lua R Fortran Pascal
one C/C++ file & header ==> 8 functions: - beep - tray notify popup - message & question - input & password - save file - open file(s) - select folder - color picker complements OpenGL Vulkan GLFW GLUT GLUI VTK SFML TGUI SDL Ogre Unity3d ION OpenCV CeGui MathGL GLM CPW GLOW Open3D ImGui MyGui GLT NGL STB Nuklear Fenster MicroUi & head-less programs NO INIT NO MAIN LOOP NO LINKING NO INCLUDE win (XP to 11) ASCII MBCS UTF-8 UTF-16 (wchar_t) - native dialogs osx/unix... -
6
ALEPH-w
Data structures and Algorithms library
...Network Flow (maximum and min cost), cut points, topological sort, spanning trees, min paths. etc. The graphs are generic in the sense that they can contain data independent of the algorithm. Several containers of the C++ STL library are implemented with Aleph-w. Their performance is better than GNU implementation -
7
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. -
8
MegEngine
Easy-to-use deep learning framework with 3 key features
...Speed and precision problems won't bother you anymore due to the same core inside. In training, GPU memory usage could go down to one-third at the cost of only one additional line, which enables the DTR algorithm. Gain the lowest memory usage when inferencing a model by leveraging our unique pushdown memory planner. NOTE: MegEngine now supports Python installation on Linux-64bit/Windows-64bit/MacOS(CPU-Only)-10.14+/Android 7+(CPU-Only) platforms with Python from 3.5 to 3.8. On Windows 10 you can either install the Linux distribution through Windows Subsystem for Linux (WSL) or install the Windows distribution directly. ... -
9
Evolutionary Computation Framework
C++ framework for application of any type of evolutionary computation.
ECF is a framework intended for application of any type of evolutionary computation (GA/GP, DE, Clonalg, ES, PSO, ABC, GAn, local search...). It offers simplicity for the end-user (parameterless usage, tutorial) and customization for experienced EC practicioners. -
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.
-
10
gendasm
Generic Code-Seeking Diassembler with Fuzzy-Function Analyzer
...It will disassemble the code and follow through branches to assist in the separation of code and data. Its included Fuzzy Function Analyzer companion uses a DNA Sequence Alignment Algorithm to locate similar code in multiple binaries to facilitate reverse-engineering and/or code recovery. The original purpose of the Fuzzy Function Analyzer was to assist in code recovery where the source code for the current binaries got lost, yet the source code for an old binary was retained. The Fuzzy Function Analyzer allows you to match up known functions between the two binaries so you can concentrate on disassembling and reverse engineering the parts that are different and recover the code for the current binary that got lost. -
11
...Book uses the examples from the demo project to explain everything in details. The examples are from many different areas. Examples from the first part of the book are aimed at the details of algorithm and its use with different objects; examples from the second part are mostly the real and very useful applications.
-
12
Evolutionary Algorithm
Evolutionary Algorithm using Python
...Users can explore basic genetic algorithm setups, match phrase examples, pathfinding challenges, and microbial GA variants, as well as evolution strategy approaches like NES. The project also links classical evolutionary approaches with neural networks, illustrating how evolution can be used for model training in reinforcement learning and supervised contexts. -
13
TorchQuantum
A PyTorch-based framework for Quantum Classical Simulation
A PyTorch-based framework for Quantum Classical Simulation, Quantum Machine Learning, Quantum Neural Networks, Parameterized Quantum Circuits with support for easy deployments on real quantum computers. Researchers on quantum algorithm design, parameterized quantum circuit training, quantum optimal control, quantum machine learning, and quantum neural networks. Dynamic computation graph, automatic gradient computation, fast GPU support, batch model terrorized processing. -
14
Metatheory.jl
General purpose algebraic metaprogramming
...The core features of Metatheory.jl are a powerful rewrite rule definition language, a vast library of functional combinators for classical term rewriting and an e-graph rewriting, a fresh approach to term rewriting achieved through an equality saturation algorithm. Metatheory.jl can manipulate any kind of Julia symbolic expression type, as long as it satisfies the TermInterface.jl. -
15
Gait Tracking With x-IMU
Foot tracking algorithm demonstrated in Seb Madgwick's 3D Tracking
This repository provides the source code for a foot-tracking algorithm using an inertial measurement unit (IMU) attached to the foot, as demonstrated in Seb Madgwick’s “3D Tracking with IMU” video (March 2011). The method performs dead reckoning to integrate foot motion and corrects for drift at each foot strike (when the foot touches the ground) to reset error accumulation. The algorithm was part of gait analysis research, estimating foot trajectories in 3D over time. ... -
16
Primus
An abstraction layer for real-time to prevent module lock-in
...No more API rewrites needed when your project requirements change, the framework gets abandoned or simply breaks down. Built-in reconnect, it just works. The reconnect is controlled by a randomised exponential back-off algorithm to reduce server stress. Offline detection, Primus is smart enough to detect when users drop their internet connection (switching WIFI points/cell towers for example) and reconnects when they are back online. -
17
DecisionTree.jl
Julia implementation of Decision Tree (CART) Random Forest algorithm
Julia implementation of Decision Tree (CART) and Random Forest algorithms. -
18
javascript-algorithms
JavaScript implementations of computer science algorithms
...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. Because algorithms are implemented in a language (JavaScript) many developers use daily, the repo becomes especially useful for students, interview-preparation candidates, or anyone wanting to learn algorithmic thinking without switching languages. The code tends to be readable, structured, and adapted to JavaScript idioms, making it easier to follow for JS developers. -
19
hello-algorithm
Algorithm training for Xiaobai
hello-algorithm is an educational repository designed to teach data structures and algorithms through clear explanations, visualizations, and code examples. It provides a structured learning path that covers fundamental concepts such as arrays, linked lists, trees, graphs, sorting algorithms, and dynamic programming. The project emphasizes understanding over memorization by breaking down complex topics into intuitive explanations supported by diagrams and examples. -
20
Direct LiDAR-Inertial Odometry
A new lightweight LiDAR-inertial odometry algorithm
DLIO is a new lightweight LiDAR-inertial odometry algorithm with a novel coarse-to-fine approach in constructing continuous-time trajectories for precise motion correction. It features several algorithmic improvements over its predecessor, DLO, and was presented at the IEEE International Conference on Robotics and Automation (ICRA) in London, UK in 2023. -
21
Robin-Stocks API Library
This is a library to use with Robinhood Financial App
...The code is simple to use, easy to understand, and easy to modify. With this library, you can view information on stocks, options, and cryptocurrencies in real-time, create your own robo-investor or trading algorithm, and improve your programming skills. The supported APIs are Robinhood, Gemini, and TD Ameritrade. If you are contributing to this project and would like to use automatic testing for your changes, you will need to install pytest and pytest-dotenv. You will also need to fill out all the fields in .test.env. I recommend that you rename the file as .env once you are done adding in all your personal information. -
22
QScript
Expression and algorithm evaluator (built with Java)
V2.1.1 compatible with Processing 2 & 3. A powerful yet simple to use scripting language that can be used to evaluate expressions and simple algorithms. In fact it is the only evaluator I know that supports complex numbers and vectors without the need for additional configuration. The emphasis is on simplicity and extensibility and the website provides detailed guides to help you get the most of QScript. It supports variables, selection (IF-THEN-ELSE) and repetition (WHILE-WEND and... -
23
Hashids
A small PHP library to generate YouTube-like IDs from numbers
...The alphabet is not base16, but base base62 by default. The alphabet is also shuffled based on salt. We need ids to be nice and friendly especially if they end up being in the URL. Therefore, the algorithm tries to avoid generating most common English curse words by never placing the following letters (and their uppercase equivalents) next to each other. There are no collisions because the method is based on integer to hex conversion. As long as you don't change constructor arguments midway, the generated output will stay unique to your salt. -
24
GeneticSharp
GeneticSharp is a fast, extensible, multi-platform and multithreading
GeneticSharp is a fast, extensible, multi-platform and multithreading C# Genetic Algorithm library that simplifies the development of applications using Genetic Algorithms (GAs). Can be used in any kind of .NET 6, .NET Standard and .NET Framework apps, like ASP .NET MVC, ASP .NET Core, Blazor, Web Forms, UWP, Windows Forms, GTK#, Xamarin, MAUI and Unity3D games. GeneticSharp and extensions (TSP, AutoConfig, Bitmap equality, Equality equation, Equation solver, Function builder, etc). ... -
25
Jadecy
Java lib to compute (code) deps, SCCs, and cycles (Johnson algorithm).
Jadecy (Java Dependencies and Cycles) is a Java library to compute dependencies (elements depended on, or depending), strongly connected components, and cycles, in general directed graphs, or classes or packages dependencies graphs parsed from class files (major version <= 52, else does best effort). It uses Tarjan's algorithm for SCCs computation, and Johnson's algorithm for exhaustive cycles computation, with continuations instead of recursion, which allows to handle large graphs (< 2^31 vertices). Since version 1.1, can also compute shortest cycles covering all edges of SCCs. Usage from command line is also possible but with reduced flexibility (cf. ...
