An “open-thoughts” research — Ad Hoc Broadcast, Trace, and Revoke.
A JavaScript library of sorted array operations
Chart 2.0 is represented by a function that draws on a canvas object using consecutive numeric values. Version 2.0 of this compact chart takes into account both positive and negative values from the input. Thus, chart 2.0 uses a lower bound as well as an upper bound.
Tiny, zero-dependency binary search and sorted-array operations (indexOf, includes, insert, remove) for JavaScript and TypeScript. Every result is a valid Array.splice() index — no bounds checks, no off-by-one. Equivalent to std::lower_bound / bisect_left.
🔍 JavaScript and TypeScript implementation of lower_bound and upper_bound for efficient data searching.
Some generic algorithms to work in C.
Implementation of lower and upper bound approximation algorithms for an NP-hard problem, with heuristics (Greedy, Layout) and metaheuristics (Genetic Algorithm, Simulated Annealing) to balance solution quality and efficiency
A feature-rich React Counter App with customizable step size, upper/lower bounds, negative toggle, and persistent state using localStorage.
Python utilities to compute a lower bound of the expected sample complexity to identify the best arm in a bandit model
Time Series Indexing By Dynamic Covering with Cross-Range Constraints @VLDBJ
Add a description, image, and links to the lower-bound topic page so that developers can more easily learn about it.
To associate your repository with the lower-bound topic, visit your repo's landing page and select "manage topics."