Search Results for "solver"
Sort By:
Showing 62 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.
-
Context for your AI agentsBuild data pipelines that feed your AI models and agents without managing infrastructure. Crawl any website, transform content, and push directly to your preferred vector store. Use 10,000+ tools for RAG applications, AI assistants, and real-time knowledge bases. Monitor site changes, trigger workflows on new data, and keep your AIs fed with fresh, structured information. Cloud-native, API-first, and free to start until you need to scale.
-
1
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!
-
2
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... -
3
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... -
4
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". -
Free and Open Source HR SoftwareGive your HR team the tools they need to streamline administrative tasks, support employees, and make informed decisions with the OrangeHRM free and open source HR software.
-
5
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. -
6
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. -
7
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).
-
8
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). -
9
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. -
Smart Business Texting that Generates PipelineTextUs is the leading text messaging service provider for businesses that want to engage in real-time conversations with customers, leads, employees and candidates. Text messaging is one of the most engaging ways to communicate with customers, candidates, employees and leads. 1:1, two-way messaging encourages response and engagement. Text messages help teams get 10x the response rate over phone and email. Business text messaging has become a more viable form of communication than traditional mediums. The TextUs user experience is intentionally designed to resemble the familiar SMS inbox, allowing users to easily manage contacts, conversations, and campaigns. Work right from your desktop with the TextUs web app or use the Chrome extension alongside your ATS or CRM. Leverage the mobile app for on-the-go sending and responding.
-
10
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/ -
11
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/). -
12
COVID19 Data Visualization HoloLens2
Experimental COVID-19 data visualization for HoloLens 2
...CreateMeshes() creates the graph for three data values and text label. Main menu's Radio buttons simply show/hide GraphContainer objects. Menu stays around the user with tag-along behavior which is provided by MRTK's RadialView solver. Using the pin button, you can toggle tag-along behavior. -
13
Dep
Go dependency management tool experiment
Dep was an official experiment to implement a package manager for Go. While dep has many discrete components and moving parts, all of these parts revolve around a central model. Dep is a tool intended primarily for use by developers, to support the work of actually writing and shipping code. It is not intended for end users who are installing Go software - that's what go get does. It is strongly recommended that you use a released version of dep. While tip is never purposefully broken, its... -
14
mssolver
Automatic solver of a minesweeper game
This is an automatic algorithm, which solves a minesweeper game field -
15
Sudoku Game Solver Generator
Standalone Complete Sudoku puzzle Game Solver Generator for Windows
This is the most complete and standalone Sudoku puzzle suite for Windows. It includes comfort playing with undo steps and powerful Sudoku generator with different difficulty levels. Also you can create Sudoku game manually and print it on an A4/Letter paper. Tutorial mode with solving hints for newbies is included too. Also there is High Score table and built-in timer for professional players. The Sudoku generation algorithm used by this app is my ultimate proud. Primarily it was based on... -
16
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... -
17
Linear Program Solver (Solvexo) is an optimization package intended for solving linear programming problems. The main features of the Solvexo are: · Solvexo solver is based on the efficient implementation of the simplex method (one or two phases); · Solvexo provides not only an answer, but a detailed solution process as a sequence of simplex matrices, so you can use it in studying (teaching) linear programming
-
18
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. ... -
19
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. -
20
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. -
21
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 ------ -
22
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. -
23
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 -
24
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 -
25
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)
