Search Results for "solver"
Sort By:
Showing 57 open source projects for "solver"
View related business solutions-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
Go From AI Idea to AI App FastAccess Gemini 3 and 200+ models. Build chatbots, agents, or custom models with built-in monitoring and scaling.
-
1
WALA
Libraries for Analysis, with frontends for Java, Android, and JS
The T. J. Watson Libraries for Analysis (WALA) provide static analysis capabilities for Java bytecode and related languages and for JavaScript. The system is licensed under the Eclipse Public License, which has been approved by the OSI (Open Source Initiative) as a fully certified open-source license. The initial WALA infrastructure was independently developed as part of the DOMO research project at the IBM T.J. Watson Research Center. In 2006, IBM donated the software to the community. The... -
2
Cabal
Upstream development repository for Cabal and cabal-install
Cabal is a system for building and packaging Haskell libraries and programs. It defines a common interface for package authors and distributors to easily build their applications in a portable way. Cabal is part of a larger infrastructure for distributing, organizing, and cataloging Haskell libraries and programs. The term cabal can refer to either: cabal-the-spec (.cabal files), cabal-the-library (code that understands .cabal files), or cabal-the-tool (the cabal-install package which... -
3
hbox
Sokoban solver written in Ada
This is a commandline-terminal sokoban solver written in Ada. It is "generic" in the sense that it contains no domain specific strategies. It also provides a demonstration of the incredible power of the Hungarian Algorithm. The proper command to extract the archive and maintain the directory structure is "7z x filename". -
4
GNU Prolog
The GNU Prolog native compiler
GNU Prolog is a free implementation (under GPL) of the logic programming language PROLOG. It can compile to native machine code which is extremely fast in execution. Another feature is the included constraint solver. -
Enterprise-grade ITSM, for every businessFreshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.
-
5
ECLiPSe CLP
ECLiPSe Constraint Logic Programming System
The ECLiPSe Constraint Logic Programming System is designed for solving combinatorial optimization problems, for the development of new constraint solver technology and their hybrids, and for the teaching of modelling, solving and search techniques. -
6
YACS (Yet Another Constraint Solver) is a Java library and an object-oriented framework for constraint solvers. It supports propagating and solving of constraint satisfaction problems with finite and infinite domains (discrete values and real intervals).
-
7
GeneticSharp
GeneticSharp is a fast, extensible, multi-platform and multithreading
...Can be used in any kind of .NET 6, .NET Standard and .NET Framework apps, like ASP .NET MVC, ASP .NET Core, Blazor, Web Forms, UWP, Windows Forms, GTK#, Xamarin, MAUI and Unity3D games. GeneticSharp and extensions (TSP, AutoConfig, Bitmap equality, Equality equation, Equation solver, Function builder, etc). A Blazor client application template with GeneticSharp ready to run a Travelling Salesman Problem (TSP). A console application template with GeneticSharp, you just need to implement the chromosome and fitness function. A console application template with GeneticSharp ready to run a Travelling Salesman Problem (TSP). -
8
Triton
Triton is a dynamic binary analysis library
Triton is a dynamic binary analysis library. It provides internal components that allow you to build your program analysis tools, automate reverse engineering, perform software verification or just emulate code. Linux, Windows and OS X compatible. You can directly compile source code from our Github repository. The Triton library is Linux, Windows and OS X compatible. A potential way to getting started is to see our Python examples already bootstrapped. -
9
lpsolve
Mixed Integer Linear Programming (MILP) solver.
Mixed Integer Linear Programming (MILP) solver lp_solve solves pure linear, (mixed) integer/binary, semi-cont and special ordered sets (SOS) models.lp_solve is written in ANSI C and can be compiled on many different platforms like Linux and WINDOWS This project is moved to github: https://lp-solve.github.io/ -
Secure File Transfer for Windows with Cerberus by RedwoodCerberus supports unlimited users and connections on a single IP, with built-in encryption, 2FA, and a browser-based web client — all deployable in under 15 minutes with a 25-day free trial.
-
10
GLPK for Java
Java language binding for the GNU Linear Programming Kit (GLPK)
GLPK for Java provides a Java language binding for the library GLPK. GLPK is a proven solver for linear and mixed integer mathematical programming problems. For Windows binaries see project GLPK for Windows (http://sourceforge.net/projects/winglpk/). -
11
GoodByeCatpcha
Solver ReCaptcha v2 Free
An async Python library to automate solving ReCAPTCHA v2 by images/audio using Mozilla's DeepSpeech, PocketSphinx, Microsoft Azure’s, Google Speech and Amazon's Transcribe Speech-to-Text API. Also image recognition to detect the object suggested in the captcha. Built with Pyppeteer for Chrome automation framework and similarities to Puppeteer, PyDub for easily converting MP3 files into WAV, aiohttp for async minimalistic web-server, and Python’s built-in AsyncIO for convenience. -
12
mssolver
Automatic solver of a minesweeper game
This is an automatic algorithm, which solves a minesweeper game field -
13
TSP Solver and Generator
Generate and solve Travelling Salesman Problem tasks
TSPSG is intended to generate and solve Travelling Salesman Problem (TSP) tasks. It uses Branch and Bound method for solving. An input is a number of cities and a matrix of city-to-city travel prices. The matrix can be populated with random values in a given range (useful for generating tasks). The result is an optimal route, its price, step-by-step matrices of solving and solving graph. The task can be saved in internal binary format and opened later. The result can be printed or saved as... -
14
abumpack
Fortran library with the Abaqus user material subroutines UMAT/VUMAT
This library contains several of user material subroutines for implicit quasi-static (UMAT) and explicit dynamic (VUMAT) versions of the Abaqus solver. The project web site: http://abumpack.sf.net. The Abaqus is a proprietary finite element (FE) code ( http://www.3ds.com/products-services/simulia/products/abaqus/). Users can write subroutines for use with the Abaqus. Linear elastic, isotropic hardening plasticity, Gurson-Tvergaard-Needleman (GTN), Rousselier constitutive models are provided. ... -
15
ViennaCL
Linear algebra and solver library using CUDA, OpenCL, and OpenMP
ViennaCL provides high level C++ interfaces for linear algebra routines on CPUs and GPUs using CUDA, OpenCL, and OpenMP. The focus is on generic implementations of iterative solvers often used for large linear systems and simple integration into existing projects. -
16
Tetris Puzzle Solver
Fills a rectangle using given tetris shapes
Fills a rectangle using given tetris shapes (tetraminos) using an optimized brute force algorithm. A puzzle can have many different solutions; this solver will stop at the first one. Not all puzzles are solveable. Created to solve the annoying tetris puzzles in The Talos Principle and Sigils of Elohim. -
17
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. -
18
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 -
19
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.
-
20
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 -
21
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) -
22
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 ! -
23
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). -
24
* 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
-
25
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...
