Search Results for "greedy"
Sort By:
Showing 35 open source projects for "greedy"
View related business solutions-
Stop Storing Third-Party Tokens in Your DatabaseRolling your own OAuth token storage can be a security liability. Token Vault securely stores access and refresh tokens from federated providers and handles exchange and renewal automatically. Connected accounts, refresh exchange, and privileged worker flows included.
-
Try Google Cloud Risk-Free With $300 in CreditUse your credit across every product. Compute, storage, AI, analytics. When it runs out, 20+ products stay free. You only pay when you choose to.
-
1
PICSL Greedy Registration Tool
Fast deformable 3D image registration tool
Greedy is a tool for fast medical image registration. It was developed at the Penn Image Computing and Science Lab at the University of Pennsylvania. The motivation for developing greedy was to have a really fast CPU-based deformable image registration tool that could be used in applications where many images have to be registered in parallel - like multi-atlas image segmentation. -
2
CausalInference.jl
Causal inference, graphical models and structure learning in Julia
Julia package for causal inference and analysis, graphical models and structure learning. This package contains code for the PC algorithm and the extended FCI algorithm, the score based greedy equivalence search (GES) algorithm, the Bayesian Causal Zig-Zag sampler and a function suite for adjustment set search. -
3
Melody
Melody is a language that compiles to regular expressions
Melody is a language that compiles to regular expressions and aims to be more easily readable and maintainable. All quantifiers can be preceded by lazy to match the least amount of characters rather than the most characters (greedy). -
4
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. Many entries include template code and “swap-in” variations, helping you recognize how the same technique adapts across similar problems. ... -
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.
-
5
LeetCode Master
About "Code Thoughts" LeetCode Practice Guide: 200 classic questions
...The repository contains detailed explanations, categorized problem sets, and step-by-step reasoning behind solutions, making it an effective study companion for developers preparing for technical interviews. Problems are grouped by topic—such as arrays, linked lists, dynamic programming, greedy algorithms, and graph theory—so learners can focus on specific areas systematically. Each solution is accompanied by clear commentary to explain the thought process, algorithm design, and complexity analysis. The project is continuously updated and widely used by learners as both a reference and a roadmap to progress from beginner to advanced LeetCode practice. ... -
6
AlphaZero.jl
A generic, simple and fast implementation of Deepmind's AlphaZero
...Many simple Python implementations can be found on Github, but none of them is able to beat a reasonable baseline on games such as Othello or Connect Four. As an illustration, the benchmark in the README of the most popular of them only features a random baseline, along with a greedy baseline that does not appear to be significantly stronger. -
7
annyang!
Speech recognition for your site
annyang is a tiny javascript library that lets your visitors control your site with voice commands. annyang supports multiple languages, has no dependencies, weighs just 2kb and is free to use. annyang understands commands with named variables, splats, and optional words. Use named variables for one word arguments in your command. Use splats to capture multi-word text at the end of your command (greedy). Use optional words or phrases to define a part of the command as optional. annyang plays nicely with all browsers, progressively enhancing browsers that support SpeechRecognition, while leaving users with older browsers unaffected. Grab the latest version of annyang.min.js, drop it in your html, and start adding commands. You can easily add a GUI for the user to interact with Speech Recognition using Speech KITT. ... -
8
Open Source Routing Machine
Open Source Routing Machine - C++ backend
...Table computes the duration or distances of the fastest route between all pairs of supplied coordinates. Match snaps noisy GPS traces to the road network in the most plausible way. Trip solves the Traveling Salesman Problem using a greedy heuristic. Tile generates Mapbox Vector Tiles with internal routing metadata. To quickly try OSRM use our demo server which comes with both the backend and a frontend on top. The easiest and quickest way to setup your own routing engine is to use Docker images we provide. We base our Docker images (backend, frontend) on Debian and make sure they are as lightweight as possible. -
9
MLJAR Studio
Python package for AutoML on Tabular Data with Feature Engineering
We are working on new way for visual programming. We developed a desktop application called MLJAR Studio. It is a notebook-based development environment with interactive code recipes and a managed Python environment. All running locally on your machine. We are waiting for your feedback. The mljar-supervised is an Automated Machine Learning Python package that works with tabular data. It is designed to save time for a data scientist. It abstracts the common way to preprocess the data,... -
AI-generated apps that pass security reviewRetool lets you generate dashboards, admin panels, and workflows directly on your data. Type something like “Build me a revenue dashboard on my Stripe data” and get a working app with security, permissions, and compliance built in from day one. Whether on our cloud or self-hosted, create the internal software your team needs without compromising enterprise standards or control.
-
10
OpenNMT-tf
Neural machine translation and sequence learning using TensorFlow
OpenNMT is an open-source ecosystem for neural machine translation and neural sequence learning. OpenNMT-tf is a general-purpose sequence learning toolkit using TensorFlow 2. While neural machine translation is the main target task, it has been designed to more generally support sequence-to-sequence mapping, sequence tagging, sequence classification, language modeling. Models are described with code to allow training custom architectures and overriding default behavior. For example, the... -
11
OpenWheel
Creation of Covering Set using a greedy algorithm
It's a console program. It create Lotto Covering Set or OpenWheels using a true greedy method with full usage of multithreads and 64bits addressing. It can create partial wheels for lotto or keno games. It can handle m=3..12 Up to v=99 balls k up to 12. Of course real values dépends of your hardware configuration. You have to agree with a big Y the ressources involved. -
12
Starlight.jl
A greedy game engine for greedy programmers
Welcome to the documentation for Starlight.jl, a greedy application framework for greedy developers. Its primary use case is video games, but the power of Julia, SDL2, Vulkan, and the Bullet Physics SDK can be leveraged to make just about anything you want. With a focus on flexibility and code quality, Starlight aims to be such a framework. It includes a suite of components and integrations that make it particuarly well-suited for video games, so it is not a stretch to call it a "game engine". ... -
13
C coding guidebook
Escape greedy companies. Learn with the help of a community for free.
Ever seen ads that sell you coding classes to ensure your future? Well Computers were made for the people, by the people and its of the people. You do not need Expensive courses Made for beginners in mind, important points have been highlighted. The latter part is advanced. But still facing difficulty? Check out the wiki page for help, our subreddit for help, link in support page Heck there is YouTube too, its from there i learnt C and I am trying my best to keep on adding to... -
14
Zopfli
Zopfli Compression Algorithm is a compression library
...It keeps strict compatibility with the ubiquitous DEFLATE format, so outputs can be decompressed by any standard tool or browser. The encoder performs exhaustive block splitting and greedy but thorough match searching to shave extra bytes off assets, which is ideal for web content and firmware where size matters more than compression time. A companion utility, zopflipng, targets PNGs by trying alternate filter strategies and recompressing IDAT chunks, often achieving additional savings without changing image quality. ... -
15
VirtualCockroach
Cockroach Desktop "Pet"
...Modify the tentacle animation, change from simple png reading to automatic random movement. Update window menu interface, support drag window. Expand the optional range of cockroach sizes, but don't be greedy and be careful that system resource usage is too high. -
16
Active Learning
Framework and examples for active learning with machine learning model
...The main experiment runner (run_experiment.py) supports a wide range of configurations, including batch sizes, dataset subsets, model selection, and data preprocessing options. It includes several established active learning strategies such as uncertainty sampling, k-center greedy selection, and bandit-based methods, while also allowing for custom algorithm implementations. The framework integrates with both classical machine learning models (SVM, logistic regression) and neural networks. -
17
The Teachingbox uses advanced machine learning techniques to relieve developers from the programming of hand-crafted sophisticated behaviors of autonomous agents (such as robots, game players etc...) In the current status we have implemented a well founded reinforcement learning core in Java with many popular usecases, environments, policies and learners. Obtaining the teachingbox: FOR USERS: If you want to download the latest releases, please visit:...
-
18
program.MODULAR
MODULAR: Autonomous Computation of Modularity
...The software can identify and define modules by two different modularity metrics widely used in studies with different types of networks such as social, ecological and biochemical networks. In order to find the network partition that maximizes modularity, the software offers five optimization methods to the user: simulated annealing, fast greedy, spectral partitioning, a hybrid of fast greedy and simulated annealing, and a hybrid of spectral partitioning and simulated annealing. The software is implemented in C language and it uses the igraph library for complex network research. -
19
DySC
DySC: Software for Greedy Clustering of 16S rRNA Reads
Pyrosequencing technologies are frequently used for sequencing the 16S rRNA marker gene for profiling microbial communities. Clustering of the produced reads is an important but time-consuming task. We present DySC, a new tool based on the greedy clustering approach which uses a dynamic seeding strategy. Evaluations based on the normalized mutual information criterion shows that DySC produces higher quality clusters than UCLUST and CD-Hit at a comparable runtime. -
20
The `fmtt` formatter
A plain text formatter for typescripts.
... - Uses Unicode internally, reads and writes 8-bit oder UTF-8 encoded files. - Recognizes preformatted paragraphs (eg source code, tables). - Reformats paragraphs either using the traditional greedy line breaking algorithm, or a TeX-like optimizing algorithm. -
21
...In this work, we deal with inversion events, which occur when a segment of DNA sequence in the genome is reversed. In our model, each inversion costs the number of elements in the reversed segment. We present a new algorithm for this problem based on the metaheuristic called Greedy Randomized Adaptive Search Procedure (GRASP) that has been routinely used to find solutions for combinatorial optimization problems. In essence, we implemented an iterative process in which each iteration receives a feasible solution whose neighborhood is investigated. Our analysis shows that we outperform any other approach by significant margin.
-
22
IronMeta is an implementation of Alessandro Warth's OMeta metaprogramming system in C#. It provides a packrat parser generator that generates parsers for Parsing Expression Grammars that operate on arbitrary streams of objects.
-
23
cutting stock problem java library
Java library to solve cutting stock problem using greedy approach
-
24
-
25
The Atlas-Link software implements a greedy algorithm and uses graph theory to link and orient assembled existing contigs quickly and accurately using mate pair information.
