Search Results for "open solver"
Sort By:
Showing 5 open source projects for "open solver"
View related business solutions-
Build Agents and Models on One PlatformGemini Enterprise Agent Platform is Google Cloud's comprehensive platform for developers to build, scale, govern, and optimize agents and models. Choose from Google's most advanced models and third-party models like Anthropic's Claude Model Family.
-
Fully Managed MySQL, PostgreSQL, and SQL ServerCloud SQL handles your database ops end to end, so you can focus on your app.
-
1
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/). -
2
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... -
3
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. -
4
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 ! -
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.
-
5
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.
- Previous
- You're on page 1
- Next