Search Results for "algorithm"
Sort By:
838 projects for "algorithm" with 1 filter applied:
-
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.
-
Cut Data Warehouse Costs by 54%BigQuery delivers 54% lower TCO with exabyte scale and flexible pricing. Free migration tools handle the SQL translation automatically.
-
1
X For You Feed Algorithm
Algorithm powering the For You feed on X
X For You Feed Algorithm is the open-sourced core recommendation system that powers the For You feed on X (the social network formerly known as Twitter), and it represents one of the first times a major social platform has published production-level ranking code for public review and experimentation. The repository contains the full pipeline that ingests user engagement and content candidate data, processes it through retrieval, hydration, filtering, scoring, and selection layers, and ultimately ranks posts to show what appears in a user’s feed. ... -
2
how-to-optim-algorithm-in-cuda
How to optimize some algorithm in cuda
how-to-optim-algorithm-in-cuda is an open educational repository focused on teaching developers how to optimize algorithms for high-performance execution on GPUs using CUDA. The project combines technical notes, code examples, and practical experiments that demonstrate how common computational kernels can be optimized to improve speed and memory efficiency. -
3
The Algorithms - C++ #
Collection of various algorithms in mathematics, machine learning
...The repository functions both as a study resource and as a reference library for developers who want examples of algorithm implementations in C++. Because the project is maintained collaboratively, new algorithms and improvements are continually added by contributors from around the world. -
4
ML-NLP
This project is a common knowledge point and code implementation
...In addition to technical explanations, the project organizes content into topic areas such as deep learning fundamentals, natural language processing techniques, and algorithm engineering practices. -
$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
JavaScript Algo and Data Structures
Algorithms and data structures implemented in JavaScript
...Multilingual README files make the resource accessible to a global audience. With strong community engagement, it is one of the most popular algorithm repositories on GitHub. -
6
PHP Snowflake
An ID Generator for PHP based on Snowflake Algorithm
An ID Generator for PHP based on Snowflake Algorithm (Twitter announced). Snowflake is a network service that generates unique ID numbers at high scale with simple guarantees. If you want to generate unique IDs using the snowflake algorithm, you must ensure that sequence numbers generated within the same millisecond on the same node are unique. Based on this requirement, we have created this package which integrates multiple sequence number providers. -
7
LeetCode Animation
Demonstrate all the questions on LeetCode in the form of animation
LeetCodeAnimation is an educational open source project by MisterBooo that visually demonstrates algorithm problems from LeetCode through animations. The goal of the project is to help learners understand complex algorithmic concepts intuitively by showing step-by-step animated explanations instead of relying solely on static code or text. Each animation corresponds to a specific problem and illustrates how data structures and algorithms operate dynamically, making it easier to grasp their underlying logic. ... -
8
Node Argon2
Node.js bindings for Argon2 hashing algorithm
A Node.js library for hashing passwords securely using the Argon2 key derivation function, a modern cryptographic algorithm. -
9
Smart Excalidraw
A smart, powerful, and beautiful excalidraw drawing tool
...It leverages large language models to interpret user input and automatically produce structured diagrams such as flowcharts, architecture diagrams, ER diagrams, and mind maps with logical layouts and clean visual organization. One of its key innovations is a smart connection algorithm that optimizes how elements are linked, reducing visual clutter and ensuring clarity in complex diagrams. The tool integrates seamlessly with the Excalidraw format, allowing users to refine, edit, and customize AI-generated diagrams manually on an interactive canvas. It supports more than twenty diagram types and can automatically select the most appropriate format based on the user’s description, making it highly adaptable across technical and creative use cases. -
Go from Code to Production URL in SecondsSkip the Kubernetes configs. Cloud Run handles HTTPS, scaling, and infrastructure automatically. Two million requests free per month.
-
10
SOFAJRaft
A production-grade java implementation of RAFT consensus algorithm
SOFAJRaft is a production-level, high-performance Java implementation based on the RAFT consistency algorithm that supports MULTI-RAFT-GROUP for high-load, low-latency scenarios. With SOFAJRaft you can focus on your business area. SOFAJRaft handles all RAFT-related technical challenges. SOFAJRaft is very user-friendly, which provides several examples, making it easy to understand and use. -
11
AIDE ML
AI-Driven Exploration in the Space of Code
AIDE ML is an open-source research framework designed to explore automated machine learning development through agent-based search and code optimization. The project implements the AIDE algorithm, which uses a tree-search strategy guided by large language models to iteratively generate, evaluate, and refine code. Instead of relying on manual experimentation, the agent autonomously drafts machine learning pipelines, debugs errors, and benchmarks performance against user-defined evaluation metrics. The system repeatedly improves its generated code by exploring different implementation paths and selecting the best-performing solutions. ... -
12
InterviewGuide
Repository that collects extensive computer science
...It was created by a developer who documented his own journey from campus to tech industry, including detailed learning pathways for languages like C/C++, Go, JavaScript, and frameworks like Vue, as well as topics such as operating systems, networks, databases, and Redis. The repository contains curated algorithm and data structure explanations, collections of interview questions, high-frequency topics, and practical problem-solving guides to help users brush up on skills that are often tested in technical interviews. -
13
MCScanX
MCScanX: Multiple Collinearity Scan toolkit X version
MCScanX is a toolkit for detecting gene synteny and collinearity, aiding in the evolutionary analysis of gene arrangements across multiple genomes. It extends the original MCScan algorithm by incorporating additional utilities for visualization and downstream analyses. -
14
ngraph.path
Path finding in a graph
...It provides a clean API for constructing graph models, assigning weights to edges, and querying for optimal routes between nodes, making it useful for routing, games, maps, and network optimization. The library includes several algorithm implementations such as A*, Dijkstra’s, and breadth-first search, each suited to different types of graph structure and performance needs. It can be integrated with visualization libraries like VivaGraphJS to animate or highlight computed paths in a rendered graph, enabling interactive routing features. Its data structures and algorithm choices are optimized for performance and memory efficiency, so even large meshes or road networks can be navigated interactively. ... -
15
D4RL
Collection of reference environments, offline reinforcement learning
...It contains standardized environments, tasks and datasets (observations, actions, rewards, terminals) aimed at enabling reproducible research in offline RL. Researchers can load a dataset for a given task (e.g., maze navigation, manipulation) and apply their algorithm without the need to collect fresh transitions, which accelerates experimentation and comparison. The API is based on Gymnasium (via gym.make) and each environment also exposes a method get_dataset() that returns the offline data to learn from. The repository emphasizes open science, reproducibility, and benchmarking at scale, making it easier to compare algorithms on equal footing. -
16
EPLB
Expert Parallelism Load Balancer
EPLB is DeepSeek’s open implementation of a load balancing algorithm designed for expert parallelism (EP) settings in MoE architectures. In EP, different “experts” are mapped to different GPUs or nodes, so load imbalance becomes a performance bottleneck if certain experts are invoked much more often. EPLB solves this by duplicating heavily used experts (redundancy) and then placing those duplicates across GPUs to even out computational load. -
17
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. ... -
18
Torch Pruning
DepGraph: Towards Any Structural Pruning
...The library focuses on reducing the size and computational cost of neural networks by removing redundant parameters and channels while maintaining model performance. It introduces a graph-based algorithm called DepGraph that automatically identifies dependencies between layers, allowing parameters to be pruned safely across complex architectures. This dependency analysis makes it possible to prune large networks such as transformers, convolutional networks, and diffusion models without breaking the computational graph. Torch-Pruning physically removes parameters rather than masking them, which results in smaller and faster models during both training and inference. ... -
19
deep-q-learning
Minimal Deep Q Learning (DQN & DDQN) implementations in Keras
The deep-q-learning repository authored by keon provides a Python-based implementation of the Deep Q-Learning algorithm — a cornerstone method in reinforcement learning. It implements the core logic needed to train an agent using Q-learning with neural networks (i.e. approximating Q-values via deep nets), setting up environment interaction loops, experience replay, network updates, and policy behavior. For learners and researchers interested in reinforcement learning, this repo offers a concrete, runnable example bridging theory and practice: you can execute the code, play with hyperparameters, observe convergence behavior, and see how deep Q-learning learns policies over time in standard environments. ... -
20
Pythonic Data Structures and Algorithms
Minimal examples of data structures and algorithms in Python
...It offers working, often well-commented code for many standard algorithmic problems — from sorting/searching to graph algorithms, dynamic programming, data structures, and more — making it a valuable resource for learning and reference. For students preparing for technical interviews, self-learners brushing up on fundamentals, or developers wanting to understand algorithm internals, this repository provides ready-to-run examples, and can serve as a sandbox to experiment, benchmark, or adapt code. Because it’s in pure Python, it’s easy to read and modify, making it accessible even to those with modest programming experience. The repo helps bridge the gap between theoretical algorithm descriptions and real-world code, giving concrete, working implementations that one can study, debug, or extend. -
21
LeetCode Book
Comprehensive study guide for coding interviews
LeetCode-Book is a comprehensive study guide for coding interviews that consolidates algorithm patterns, data-structure templates, and worked LeetCode solutions. It organizes problems by topic—arrays, linked lists, stacks/queues, trees/graphs, dynamic programming, greedy, backtracking, and math—so you can study systematically. Explanations are concise but intentional, highlighting why a pattern fits, how to reason about boundary cases, and the time/space trade-offs. -
22
International Components for Unicode
The home of the ICU project source code
...ICU's conversion tables are based on charset data collected by IBM over the course of many decades and is the most complete available anywhere. Compare strings according to the conventions and standards of a particular language, region or country. ICU's collation is based on the Unicode Collation Algorithm plus locale-specific comparison rules from the Common Locale Data Repository, a comprehensive source for this type of data. -
23
MemU
MemU is an open-source memory framework for AI companions
...Powerful tools and dedicated support to scale your AI applications with confidence. Full proprietary features, commercial usage rights, and white-labeling options for your enterprise needs. SSO/RBAC integration and a dedicated algorithm team for scenario-specific optimization. User behavior analysis, real-time monitoring, and automated agent optimization tools. 24/7 dedicated support team, custom SLAs, and professional implementation services. -
24
core.match
An optimized pattern matching library for Clojure
core.match is a high-performance pattern-matching library for Clojure and ClojureScript. It provides an optimized macro-based DSL for structurally matching data—such as sequences, maps, regexes—offering a clearer alternative to nested conditionals or destructuring. A symbol pattern can represent one of three behaviours. Match the value of an existing local binding. Create a "named" wildcard pattern that creates a binding of the given name to the right of the pattern row. -
25
pytudes
Python programs, usually short, of considerable difficulty
pytudes is Peter Norvig’s collection of short Python programs written to practice and demonstrate specific programming skills. The name is inspired by musical études, meaning compact exercises designed to build mastery through focused practice. The repository includes readable solutions, experiments, notebooks, and scripts that cover algorithms, puzzles, probability, search, language processing, simulation, and mathematical reasoning. It is useful for programmers who want to study elegant...