Search Results for "solver"
Sort By:
37 projects for "solver" with 2 filters applied:
-
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.
-
Eurekos LMS - Build a Smarter CustomerEurekos is a purpose-built LMS that engages customers throughout the entire learning journey from pre-sales, to onboarding, and everything after.
-
1
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. -
2
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. -
3
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).
-
4
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/ -
Criminal IP: Cybersecurity Search EngineOriginated from the idea that individuals and corporations would be able to strengthen their cyber security by proactively acquiring information about IP addresses attempting to access your network, Criminal IP uses its big data of more than 4.2 billion IP addresses to provide threat-relevant information on malicious IPs and links, phishing sites, certificates, industrial control systems, IoTs, servers, security cameras, and so forth.
-
5
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... -
6
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. ... -
7
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. -
8
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. -
9
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 -
Intelligent Automation Solutions Built for Modern Finance TeamsDigitally transform your business with workflow automation and integrated payment solutions. Digitally store and secure your data with advanced search and accessibility features that keeps your documents at the tip of your team’s fingers.
-
10
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.
-
11
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) -
12
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.
-
13
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 ! -
14
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). -
15
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... -
16
Zero Sum Game Solver JavaScript Library
Zero Sum Game Solver JavaScript Library
Zero Sum Game Solver JavaScript Library -
17
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?... -
18
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. -
19
Genetic Algorithm General Solver-GAGENES
Genetic algorithms (GA) in C++
NOTE: Project has been delayed due to other tasks. Genetic Algorithms General Solver (GAGENES) is a C++ implementation of the genetic algorithm concept. -
20
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.
-
21
The SBML ODE Solver is a command-line tool and programming library (ISO/ANSI C) for construction and numerical integration of an ODE system, derived from an SBML based description of a biochemical reaction network. Development has moved to https://github.com/raim/SBML_odeSolver . Please download the latest version from there!
-
22
A simple command line tool for solving the triangular peg solitaire game, like the one at Cracker Barrel. Also has a few other features.
-
23
ZSokoban: An efficient Sokoban engine implemented in C# including levels, levelsets, solver, utilities and full GUI player.
-
24
Our goal is to develop a full working solver for ATA (with 1 clock) in Python, with MTL to ATA support. The decidability for the emptiness problem was proposed by Lasota and Walukiewicz. The MTL to ATA was proposed by Ouaknine and Worrell.
-
25
Kuhn-Munkres is used inside assignment problem solver application. Instance generator application creates input file for the solver. Checker application verifies the solution computed by the solver. A bash script compiles, executes these apps.
