Search Results for "bounds"
Sort By:
Showing 19 open source projects for "bounds"
View related business solutions-
Gemini 3 and 200+ AI Models on One PlatformBuild generative AI apps with Vertex AI Studio. Switch between models without switching platforms.
-
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
BayesianOptimization
A Python implementation of global optimization with gaussian processes
...This technique is especially useful for hyperparameter tuning in machine learning, where evaluating the objective function is costly. The library provides an easy-to-use API for defining bounds and optimizing over parameter spaces using probabilistic models like Gaussian Processes. -
2
Checked C
Checked C is an extension to C that lets programmers write C code
...Checked C does not address use-after-free errors. Checked C adds static and dynamic checking to C to detect or prevent common programming errors such as buffer overruns and out-of-bounds memory accesses. The goal of the project is to improve systems programming by making fundamental improvements to C. This repo contains sample code, the extension specification, and test code. The Checked C project is extending the C programming language so that programmers can write more secure and reliable C programs. The project is developing an extension to C called Checked C that adds checking to C to detect or prevent common programming errors such as buffer overruns, out-of-bounds memory accesses, and incorrect type casts. -
3
Wuffs
Wrangling Untrusted File Formats Safely
Wuffs is a memory-safe, zero-dependency library and domain-specific language for writing high-performance image codecs and related parsers. Instead of trusting ad-hoc C, Wuffs code is compiled to C with strong bounds, integer, and state checks inserted by construction, aiming to eliminate whole classes of security bugs without a heavy runtime. The design prioritizes predictable performance: decoders avoid dynamic allocation by default, return explicit “short read” signals, and run well in streaming or sandbox-free environments. The project ships battle-tested, CPU-friendly implementations for common image/container formats and bit-twiddly primitives like Huffman and checksum routines. ... -
4
Cave Story MD
A fan port of Cave Story for the Sega Mega Drive
This is a rewrite/port of the popular freeware game Cave Story for Sega Mega Drive/Genesis. It should work on any console or emulator. The main story is "finished", only little things and bugfixes remain. A fan port of Cave Story for the Sega Mega Drive. -
Catch Bugs Before Your Customers DoMove from alert to fix before users notice. AppSignal monitors errors, performance bottlenecks, host health, and uptime—all from one dashboard. Instant notifications on deployments, anomaly triggers for memory spikes or error surges, and seamless log management. Works out of the box with Rails, Django, Express, Phoenix, Next.js, and dozens more. Starts at $23/month with no hidden fees.
-
5
plow
A high-performance HTTP benchmarking tool
...It can run for a set duration( option -d), for a fixed number of requests(option -n), or until Ctrl-C is interrupted. The implementation of real-time computing Histograms and Quantiles using stream-based algorithms inspired by Prometheus with low memory and CPU bounds. so it's almost no additional performance overhead for benchmarking. -
6
Interval arithmetic for Ada
An implementation of interval arithmetic
The library provides an implementation of intervals for Ada. It includes arithmetic and relational operations. The library supports intervals with integer and floating-point bounds. Dimensioned intervals are also supported -
7
Dynamic Arrays and Hashes (Delphi, C++)
Very fast classes for working with Dynamic Arrays in Delphi and C++
(New version 1.04 is released) Dynamic Arrays is a set of useful very fast classes for data manipulating in memory. Flexible memory control, functionality that standard containers do not have, fast operations (assembler implementation for x86 and x64 platforms). Available for Delphi all latest versions and for C++. Powerful Hash and Double Hash classes to work with pairs of values (key and value) and with values that have two keys (key1, key2, value). Give it a try and let me know how... -
8
vue-grid-layout
A draggable and resizable grid, for Vue.js.
vue-grid-layout is a grid layout system, like Gridster, for Vue.js. Heavily inspired by React-Grid-Layout. Bounds checking for dragging and resizing. Widgets can be added or removed without rebuilding grid. Layout can be serialized and restored. Automatic RTL support (resizing not working with RTL on 2.2.0). For legacy browsers, like IE11, use version 2.3.12-legacy. For Vue 2.1.10 and below use version 2.1.3. For Vue 1 use version 1.0.3. Ignore drag on certain elements and allow on others. ... -
9
vim-surround
Delete/change/add parentheses/quotes/XML-tags/much more with ease
...It turns the repetitive chores of adding, changing, or deleting delimiters into short, mnemonic commands that work with normal Vim text objects. The key insight is that surroundings are structural: once Vim understands the bounds, operations become predictable and composable with your existing motions. The plugin handles common cases like quotes and parentheses as well as HTML/XML tags, making it equally useful in prose and code. Because the commands are orthogonal to movements, you can target words, sentences, or visual selections without learning new modes. ... -
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.
-
10
Probability Cheatsheet
A comprehensive 10-page probability cheatsheet
The probability_cheatsheet is a cheat sheet repository that summarizes key probability theory concepts, formulas, distributions, and properties in a concise format. It likely includes definitions of random variables, PMFs and PDFs, expectations, variance, common distributions (e.g. binomial, normal, Poisson, exponential), conditional probability, Bayes’ theorem, moment generating functions, and perhaps important inequalities (Markov, Chebyshev, Chernoff). The cheat sheet is intended as a... -
11
OptimC
OptimC - Optimization / Unconstrained Minimization Library in ANSI C
...The algorithms implemented are Nelder-Mead,Newton Methods (Line Search and Trust Region methods), Conjugate Gradient and BFGS (regular and Limited Memory). Brent method is also available for single variable functions if the bounds are known. Update 06/09/2014 - Nonlinear Squares Implementation [Levenberg-Marquardt Method] Added. Documentation - http://code.google.com/p/optimc/ -
12
JChart2D
jchart2d is a real-time charting library written in java.
JChart2D is a easy to use component for displaying two- dimensional traces in a coordinate system written in Java. It supports real-time (animated) charting, custom trace rendering, Multithreading, viewports, automatic scaling and labels. Former UI controls (right click context menu, file menu) have been ported to the subproject jchart2d-uimenu (https://sourceforge.net/projects/jchart2d-uimenu.jchart2d.p/) for the benefit of having no dependencies to 3rd party libraries. -
13
Eclipse-StringUtils
Eclipse plug-in
String Utils - Allows you to format SQL queries inside Eclipse editor. - Extract and unescape string content from variable. How to: 1) Set cursor inside bounds of the string 2) String Utils → Format SQL or String Utils → Extract String URL: https://github.com/kbss/StringUtils_plugin -
14
...These functions are alternative functions to the existing standard C library that promote safer, more secure programming. The ISO/IEC Programming languages — C spec, C11, now includes the bounded APIs in Appendix K, "Bounds-checking interfaces". This latest upload supports building static library, a shared library and a linux kernel module.
-
15
A branch-and-prune method to find all solutions to systems of nonlinear equations. The number of variables must equal the number of equations. The variables must have proper lower and upper bounds. The solver has an interface to the AMPL environment.
-
16
A simple layout manager for java applications. The ActiveLayout arranges components in a directional flow by lines with proportional filling free spaces between components and container's bounds.
-
17
Libsbuf allows one to easily and safely manipulate character strings in plain C, taking care of e.g. reallocation and bounds checking. Originally written for FreeBSD, it works under pretty much any POSIX system out there, such as Linux.
-
18
EVM is a 32-bit virtual machine designed for easy implementation. It supports bounds checking, real-time linking and JIT compilation on x86 architecture. No platform-specific calls or byte order dependencies. Comes with an optimizing C compiler.
-
19
Geeklog Experemential Code and Plugins is for testing the bounds of possiblity with the geeklog code base as well as experemential versions of modified plugins that may be avaliable elsewhere. One focus is the Addicti0n experemential fork of Geeklog.
- Previous
- You're on page 1
- Next
