Search Results for "solver" - Page 2
Sort By:
Showing 81 open source projects for "solver"
View related business solutions-
Host LLMs in Production With On-Demand GPUsDeploy your model, get an endpoint, pay only for compute time. No GPU provisioning or infrastructure management required.
-
99.99% Uptime for MySQL and PostgreSQL DatabasesCloud SQL Enterprise Plus delivers near-zero downtime with 35 days of point-in-time recovery. Supports MySQL, PostgreSQL, and SQL Server.
-
1
Math Tools
Provides useful mathematical tools which make your work much easier.
Math Tools provides mathematical tools, allows you to calculate triangle propeties, and find both parametric and algebraic forms of planes. ------ More Tools Will be Added in The Future ------ ------ Translation to english will be completed soon ------ -
2
GSS Engine
GSS engine
GSS is a JavaScript layout engine based on Grid Style Sheets (constraint CSS) using Cassowary constraint solver. It enables declarative relational layouts—expressing 'item A aligned to the right of item B'—and compiles these constraints into standard styles at runtime or build-time. Though experimental and labeled unstable, it showcases advanced layout paradigms beyond traditional CSS. -
3
dep-trace
gdeptrace dependancy solver correct for pkg or make deps
...EXAMPLE: $ echo -e "b e\ne\nc b" | sort -k1,1 | gdeptrace [opts] e b c (b depends on e, c depends on b, e has no depends) (also: e has more items depending on it and is below anything it depends on; in this case the top, all and only by the rules known and given, in order by given where equal) $ echo -e "b e\ne\nc b" | depsort ditto, no opts needed $ libdeps objdump /lib/*.so.* (outputs if missing, load order (deps), rdeps, which are effected by missing lib/s, etc, see readme) $ doil (a package installer/solver like apt-get+dpkg which uses gdeptrace, see doil on Source Forge) dep-trace is now "gdeptrace" to ease packaging compatibility -
4
dlvhex is a prototype solver for HEX-programs which integrate Answer-Set Programs with higher-order reasoning and external computation sources. It comes with a full-fledged plug-in framework for rapid extension development.
-
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.
-
5
DisChoco
DisChoco: Distributed Constraint Reasoning Solver
DisChoco is a Distributed Constraint Reasoning Solver. Several Distributed Constraint Reasoning algorithms are implemented (like ABT, AFC, Adopt, ...). Users may easily implement and test their algorithms with DisChoco. contact: wahbi[at]users[dot]sourceforge[dot]net -
6
JBernstein
JBernstein: Exploration techniques for non-linear constraint checking
...Concerning performance, the tool enables to check all examples in the PVS Bernstein testsuite within a second, which can be an order of magnitude faster than some other tools such as QEPCAD or REDLOG. Although JBernstein uses double, it offers automatic error-estimation capabilities (experimental) so that the generated result is correct (the solver may return unknown when the error-estimate is too large) -
7
Sudokut is a platform-independent Sudoku Solver written in Tcl. It is a command line tool, with no graphic interface: just pass a sudoku problem as a string to the command and it returns all possible solutions. It also explains the entire resolution process.
-
8
Linear Program Solver
Solve linear programming problems
Linear Program Solver (LiPS) is an optimization package oriented on solving linear, integer and goal programming problems. The main features of LiPS are: ● LiPS is based on the efficient implementation of the modified simplex method that solves large scale problems. ● LiPS provides not just an answer, but a detailed solution process as a sequence of simplex tables, so you can use it for studying/teaching linear programming -
9
EasyCP
The easiest C++ way to deal with constraints !
EasyCP is a modern, user-friendly C++ library that lets you use constraint programming in a very natural way, taking advantage of its expressive power. Just model and let the CSP (Constraint Satisfaction Problem) solver do the job ! -
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.
-
10
Dantzig-Wolfe Solver
An implementation of Dantzig-Wolfe decomposition built upon GLPK
An implementation of Dantzig-Wolfe decomposition built upon the GNU Linear Programming Kit. This is a command line tool for solving properly decomposed linear programs. There are several examples and some documentation to guide the use of this solver. Forked over to GitHub (see link). -
11
* Model-checking/simulation-checking library for real-time system with dense-time models in C with CRD (Clock-Restriction Diagrams) technology. * Parametric analysis library for linear-hybrid systems in C with HRD (Hybrid-Restriction Diagram) technol
-
12
sudoku Solver
A sudoku solver project built with Java with a user friendly interface
This project has been built to allow you solve any Sudoku problem in no time. The project built using Java programming language. It`s simple interface built using Swing technology. A smart algorithm has been designed to solve your problem. First, using the systematic human way of solving. If the human failed to solve, your problem will be passed to a stronger algorithm that based on Try and Fail techniques and possibilities. Enjoy, learn and develop. You need to install Java JRE to run the... -
13
cuLsoda is an implementation of the Livermore Solver for Ordinary Differential Equations with Automatic switching for stiff and non-stiff problems (LSODA), written in NVIDIA's C for CUDA GPGPU API. NOTE: This repository is now deprecated and replaced by a new one at GitHub: https://github.com/Celemourn/cuLsoda
-
14
Kelvin's Batch Program v9.0(latest)
A simple batch program with many useful functions!
Changelogs: v9 -- Fixed MSCONFIG flooding bug v8 -- Added Adv Control Panel v7 -- Added keepsafe directory secure v6 -- Improved update system v5 -- Added sudoku solver v4 -- Added initializing screen v3 -- Display current version in main menu v2 -- Fixed netplwiz bug v1 -- New build -
15
Zero Sum Game Solver JavaScript Library
Zero Sum Game Solver JavaScript Library
Zero Sum Game Solver JavaScript Library -
16
Conflicts
Automatic Solver for Railway-related conflicts
Automatic Solver for Railway-related conflicts -
17
scd_EUgran
EUgran solver for OpenFoam with new Boundary Conditions.
In the spirit of open source software, feel free to use the code for the boundary conditions. We have tested it last year for the simulation of fluidized beds. It is an extension of the standard twoPhaseEulerFoam. It includes J&J BC's and the newer BC's for the solid phase of Schneiderbauer et. al., which are a modification of the work of Jenkins and decide between sliding and non-sliding particle-wall collisions. Additionally the computation of the solids pressure is changed to the newest... -
18
This program is used to create and solve queueing network models using Mean Value Analysis using a GUI front end and the WX widget library.
-
19
Water Retention on Magic Squares Solver
Water Retention on Magic Squares with Constraint-Based Local Search
A Constraint-Based Local Search solver for the Water Retention on Magic Squares-problem. The problem is a very hard combinatorial optimisation problem, invented by Craig Knecht. More can be read about it at: http://en.wikipedia.org/wiki/Water_retention_on_mathematical_surfaces Craig's website for the problem: http://www.knechtmagicsquare.paulscomputing.com/ The solver is mainly based on the theory and ideas from my bachelor thesis, which I wrote at Uppsala University, Sweden, for the Astra Group which does research about Constraint Programming and related technologies: Water Retention on Magic Squares with Constraint-Based Local Search http://urn.kb.se/resolve?... -
20
Simplex Solver For PHP
PHP class library for simplex method
Resolve standard Maximization / Minimization problem in LP using Simplex Method. *Currently support maximization only. -
21
Zero Sum Game Solver Java Library
Zero Sum Game Solver Java Library
Zero Sum Game Solver Java Library is open source java library to solve 2-player finite zero-sum games. This programs solve zero-sum games with linear programming. -
22
A static checker that model checks the implementation of equality for an Eclipse Java Project.
-
23
WinMumps
Visual Studio project and solution files for building MUMPS
Visual Studio project and solution files for building the MUltifrontal Massively Parallel Solver (http://graal.ens-lyon.fr/MUMPS/). WinMumps is a vc[x]proj/vfproj python based generator that allows to build Mumps (version 4.10.x) and its external dependencies (such as ptscotch, parmetis, pord) using the Microsoft C compiler and the Intel Fortran compiler. Templates for msvc10 (Visual Studio 2010), msvc8 (Visual Studio 2005), Intel Visual Fortran Compiler and Intel Composer-XE are available. -- How-to -- A) you need: 1/ the downloaded archive from Sourceforge 2/ python-2.6.x (this python script is not compatible with python 3.x) 3/ Visual Studio 2010 (or 2005) 4/ Intel XE Composer ( or Visual Fortran) 5/ Mpich2, scotch/ptscotch, metis/parmetis (optional) B)procedure: 1/ unzip the downloaded archive of WinMumps 2/ execute "python winmumps_generator.py" providing the options needed 3/ open the solution file written (using Visual Studio) and build the solution -
24
-
25
