Search Results for "solver"
Sort By:
Showing 701 open source projects for "solver"
View related business solutions-
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.
-
Keep company data safe with Chrome EnterpriseMake AI work your way with Chrome Enterprise. Block unapproved sites and set custom data controls that align with your company's policies.
-
1
The Operator Splitting QP Solver
The Operator Splitting QP Solver
OSQP uses a specialized ADMM-based first-order method with custom sparse linear algebra routines that exploit structure in problem data. The algorithm is absolutely division-free after the setup and it requires no assumptions on problem data (the problem only needs to be convex). It just works. OSQP has an easy interface to generate customized embeddable C code with no memory manager required. OSQP supports many interfaces including C/C++, Fortran, Matlab, Python, R, Julia, Rust. -
2
Forget about sleepless nights over textbooks! Solver is an application that solves equations quickly and easily. • Solve equations of any type — from linear to the fourth degree. • Save time and effort — you won't have to learn anything else. • Import and export data — work with equations from files and save solutions in the desired format. Don't miss the chance to make learning math simple and effective!
-
3
Alignment Solver
Solve Alignment of Road , Rail,Tunnel
Alignment solver is a utility to solve alignment of Road, Rail or Tunnel. It can handle horizontal and vertical offset alignment , offset in transitions. cant, Import form LANDxml and other formats , exports to Landxml, GSI , Trimble ascii , Inroads ascii etc. The project is under Heavy development. Please report any issues to the ticket system. Tested Operating Systems Windows 7 / 8 / 10/ 11 64 bit Ubuntu 16.04 / 22.04 64 bit Deepin 15 64 bit Linux Mint 18.2 64 bit MXlinux 21 -
4
Quarto Solver
Quarto Solver calculates optimal moves for Quarto and Quarto 2x2
You can calculate for every game state in Quarto and Quarto 2x2 an optimal move. -
Simple, Secure Domain RegistrationRegister or renew your domain and pay only what we pay. No markups, hidden fees, or surprise add-ons. Choose from over 400 TLDs (.com, .ai, .dev). Every domain is integrated with Cloudflare's industry-leading DNS, CDN, and free SSL to make your site faster and more secure. Simple, secure, at-cost domain registration.
-
5
LINE Solver
Queueing Theory Algorithms
LINE is an open-source software package to analyze queueing models via analytical methods and simulation. The solver is available for Java/Kotlin, MATLAB, and Python. LINE features algorithms for the solution of open queueing systems (e.g., M/M/1, M/M/k, M/G/1, ...), open and closed queueing networks, and layered queueing networks. Additional details are available on the project website: http://line-solver.sf.net. -
6
JaCoP is a Java Constraint Programming solver. It provides a significant number of (global) constraints to facilitate efficient modeling of combinatorial problems, as well as modular design of search. Documentation is available at project Web site. Please, note that the sources from version 4.0 are only available at GitHub.
-
7
Buster
Captcha solver extension for humans
Save time by asking Buster to solve captchas for you. Buster is a Firefox extension which helps you to solve difficult captchas by completing reCAPTCHA audio challenges using speech recognition. Challenges are solved by clicking on the extension button at the bottom of the reCAPTCHA widget. It is not guaranteed that challenges are always solved, the limitations of the technology need to be considered. The continued development of Buster is made possible thanks to the support of awesome... -
8
OR-Tools - Google Optimization Tools
Google's software suite for combinatorial optimization
Google Optimization Tools, also known as OR-Tools is an open-source, fast and portable software suite for solving combinatorial optimization problems. These encompass problems in vehicle routing, flows, integer and linear programming, and constraint programming. This suite contains a number of solvers, namely: a constraint programming solver; a linear programming solver; wrappers for commercial solvers (like Gurobi or CPLEX) and other open source solvers (SCIP, GLPK, etc.); among others... -
9
alphageometry
AI-driven neuro-symbolic solver for high-school geometry problems
... deduction engine with a transformer-based language model to propose and validate geometric constructions in a stepwise proof process. The DDAR solver focuses purely on rule-based reasoning, while AlphaGeometry enhances this by using a learned model to suggest auxiliary constructions when logical reasoning alone is insufficient. The repository includes pre-trained weights, vocabulary files, and detailed configuration options for reproducing experiments. -
Build Securely on AWS with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
10
SCIP.jl
Julia interface to SCIP solver
SCIP.jl is a Julia interface to the SCIP solver. This wrapper is maintained by the SCIP project with the help of the JuMP community. -
11
HiGHS.jl
Julia wrapper for the HiGHS solver
HiGHS.jl is a wrapper for the HiGHS solver. -
12
BlockArrays.jl
BlockArrays for Julia
... BlockArray stores each block contiguously while the type PseudoBlockArray stores the full matrix contiguously. This means that BlockArray supports fast noncopying extraction and insertion of blocks while PseudoBlockArray supports fast access to the full matrix to use in for example a linear solver. -
13
Chrome Captcha Auto Solver
Google Chrome Bypass Captcha Extension
Beat the captcha test experience by enabling your self to be free from any captcha input tasks. Install our newest innovation, our stable and fast Google Chrome Bypass Captcha extension application and allow us to auto-solve and auto-fill your captcha test tasks. # How to Install 1. Download the .zip file of **Chrome Captcha Auto Solver** https://sourceforge.net/projects/chrome-captcha-auto-solver/ 2. Unzip the downloaded .zip file. 3. Go to your Chrome browser's "**Customize... -
14
POT
Python Optimal Transport
This open source Python library provides several solvers for optimization problems related to Optimal Transport for signal, image processing and machine learning. -
15
LinearSolve.jl
High-Performance Unified Interface for Linear Solvers in Julia
LinearSolve.jl is a unified interface for the linear solving packages of Julia. It interfaces with other packages of the Julia ecosystem to make it easy to test alternative solver packages and pass small types to control algorithm swapping. It also interfaces with the ModelingToolkit.jl world of symbolic modeling to allow for automatically generating high-performance code. Performance is key: the current methods are made to be highly performant on scalar and statically sized small problems... -
16
NonlinearSolve.jl
High-performance and differentiation-enabled nonlinear solvers
... linear solvers, along with the ability to use sparse automatic differentiation for Jacobian construction and Jacobian-vector products. NonlinearSolve.jl interfaces with other packages of the Julia ecosystem to make it easy to test alternative solver packages and pass small types to control algorithm swapping. It also interfaces with the ModelingToolkit.jl world of symbolic modeling to allow for automatically generating high-performance code. -
17
WaterLily.jl
Fast and simple fluid simulator in Julia
WaterLily.jl is a fluid dynamics simulation package in Julia that uses lattice Boltzmann methods (LBM) to simulate incompressible flows and fluid-structure interactions in two dimensions. It is designed for easy use and rapid prototyping of physical systems involving particles, obstacles, and hydrodynamic forces. The package is well-suited for educational purposes, computational physics research, and lightweight fluid simulations. -
18
VoronoiFVM.jl
Solution of nonlinear multiphysics partial differential equations
Solver for coupled nonlinear partial differential equations (elliptic-parabolic conservation laws) based on the Voronoi finite volume method. It uses automatic differentiation via ForwardDiff.jl and DiffResults.jl to evaluate user functions along with their jacobians and calculate derivatives of solutions with respect to their parameters. -
19
Circuitscape.jl
Algorithms from circuit theory to predict connectivity
Circuitscape is an open-source program that uses circuit theory to model connectivity in heterogeneous landscapes. Its most common applications include modeling the movement and gene flow of plants and animals, as well as identifying areas important for connectivity conservation. The new Circuitscape is built entirely in the Julia language, a new programming language for technical computing. Julia is built from the ground up to be fast. As such, this offers a number of advantages over the... -
20
Tulip.jl
Interior-point solver in pure Julia
Tulip is an open-source interior-point solver for linear optimization, written in pure Julia. It implements the homogeneous primal-dual interior-point algorithm with multiple centrality corrections and therefore handles unbounded and infeasible problems. Tulip’s main feature is that its algorithmic framework is disentangled from linear algebra implementations. This allows to seamless integration of specialized routines for structured problems. -
21
Sudoku Solver For Windows
A Sudoko Solver/Puzzle Generator For MS Windows
Advanced Windows Sudoku solver and puzzle generator with a modern GUI interface. Features multiple solving techniques from basic to expert, including Standard Elimination, Hidden Singles, X-Wing, Swordfish, XY-Wing, and XYZ-Wing patterns. Generate puzzles across five difficulty levels (Easy to Extreme). Key Features: * Interactive puzzle input * Multiple advanced solving algorithms * Puzzle generation with guaranteed unique solutions * Save/load functionality with multiple slots... -
22
Evals
Evals is a framework for evaluating LLMs and LLM systems
The openai/evals repository is a framework and registry for evaluating large language models and systems built with LLMs. It’s designed to let you define “evals” (evaluation tasks) in a structured way and run them against different models or agents, with the ability to score, compare, and analyze results. The framework supports templated YAML eval definitions, solver-based evaluations, custom metrics, and composition of multi-step evaluations. It includes utilities and APIs to plug... -
23
DiffOpt.jl
Differentiating convex optimization programs w.r.t. program parameters
DiffOpt.jl is a package for differentiating convex optimization programs (JuMP.jl or MathOptInterface.jl models) with respect to program parameters. Note that this package does not contain any solver. This package has two major backends, available via the reverse_differentiate! and forward_differentiate! methods, to differentiate models (quadratic or conic) with optimal solutions. Differentiable optimization is a promising field of convex optimization and has many potential applications in game... -
24
EAGO.jl
A development environment for robust and global optimization
EAGO is an open-source development environment for robust and global optimization in Julia. EAGO is a deterministic global optimizer designed to address a wide variety of optimization problems, emphasizing nonlinear programs (NLPs), by propagating McCormick relaxations along the factorable structure of each expression in the NLP. Most operators supported by modern automatic differentiation (AD) packages (e.g., +, sin, cosh) are supported by EAGO and a number of utilities for sanitizing... -
25
Coluna.jl
Branch-and-Price-and-Cut in Julia
Coluna is a branch-and-price-and-cut framework written in Julia. You write an original MIP that models your problem using the JuMP modeling language and our specific extension BlockDecomposition offers a syntax to specify the problem decomposition. Then, Coluna reformulates the original MIP and optimizes the reformulation using the algorithms you choose. Coluna aims to be very modular and tweakable so that you can define the behavior of your customized branch-and-price-and-cut algorithm.