Search Results for "solver" - Page 12
Sort By:
Showing 694 open source projects for "solver"
View related business solutions-
Our Free Plans just got better! | Auth0 by OktaYou 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 secuirty. Auth0 now, thank yourself later.
-
Bright Data - All in One Platform for Proxies and Web ScrapingBright Data offers the highest quality proxies with automated session management, IP rotation, and advanced web unlocking technology. Enjoy reliable, fast performance with easy integration, a user-friendly dashboard, and enterprise-grade scaling. Powered by ethically-sourced residential IPs for seamless web scraping.
-
1
-
2
-
3
DeconvDemo
An image deconvolution / deblur software
DeconvDemo is a Qt & opencv based image deconvolution/ deblur software which is including the spatial and frequency domain solver. image deconvolution / deblur software with non-blind deconvolution algorithm New: Add pregressive non-blined deconvolution Add blind kernel estimation Implemented mehtod: METHOD_WIENER, METHOD_TIKHONOV, METHOD_LUCY_RICHARDSON, METHOD_CONJUGATE_GRADIENT, METHOD_SPARSE_PRIOR, METHOD_GAUSSIAN_PRIOR... -
4
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). -
Enterprise and Small Business CRM Solution | Clear C2 C2CRMC2CRM consists of four modules that integrate to provide a comprehensive CRM solution: Relationship Management, Sales Automation, Marketing Automation, and Customer Service. Only buy what each user needs.
-
5
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.
-
6
Discrete Dipole Aproximation Project
Plugin orientated Discrete Dipole Approximation (DDA) Solver
Discrete Dipole Approximation Project, is a software package designed to solve the Discrete Dipole Problem by the Discrete Dipole Approximation (DDA) method. This software is desgined to be plugin operated allowing for easy implimincation of new solver methods to improve the efficienty of the code. The plugin support also allow the program to write its output in multiple formats and structures defined by plugins. -
7
Sudoku Solver 1.0
Sudoku Solver 1.0 solves 9x9 Sudokus.
Sudoku Solver 1.0 solves 9x9 Sudokus almost instantly. It uses deductions along with backtracking. -
8
HTML5 Kill Sudoku
HTML5 step by step sudoku solver
A HTML5 sudoku solver that can solve sudoku step by step like human with skills such as find singles, subsets, X wings, W wings and so on. -
9
-
Build with generative AI, deploy apps fast, and analyze data in seconds—all with Google-grade security.Google Cloud is a cloud-based service that allows you to create anything from simple websites to complex applications for businesses of all sizes.
-
10
CADET
Chromatography Analysis and Design Toolkit
We have moved to GitHub: https://github.com/modsim/cadet The Chromatography Analysis and Design Toolkit (CADET) is developed at the Institute of Bio- and Geosciences 1 (IBG-1) under supervision of Dr. Eric von Lieres. The core of the CADET software is a fast and accurate solver for the General Rate Model (GRM) of packed bed liquid chromatography. The CADET solver covers a wide range of GRM variants, combining different transport and binding models with state-of-the-art mathematical... -
11
MathCalc aims to be a flexible calculator, it tries to make things very simple to the user. with extra features like sketching, matrix operations, Linear equation solver and more ! This document explains how to compile MathCalc and install it to your PC.
-
12
PyDQP
Distributed QP Solver in Python
PyDQP implementes 11 different dual decomposition schemes, both first and second order, in order to solve quadratic programs in a distributed fashion. -
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
SAT Solver
SAT Solver
SAT Solver for L3:proj 2 at ENS Lyon -
15
Runge
Runge is an Interactive Solver for Systems of Differential Equations
Runge is an Interactive Solver for Systems of Ordinary Differential Equations. It solves initial value problem (aka Cauchy problem). Few advantages Runge provides: It's fast. It utilizes BLAS and LAPACK libraries optimized for modern multi-core processors. It's interactive. It allows you to start a solution by mouse click on a plane. It's precise. It uses Runge Rule to adjust step length to satisfy required precision on each step. It's effective. When it needs to compute... -
16
-
17
Sudoku generator/solver/analyzer written in Java (English and German). Lots of human style techniques (singles, subsets, LCs, fish, wings, uniqueness, coloring, chains, ALS), powerful analyzer (manage multiple solutions for one sudoku). Includes Learning and training modes and a booklet printer.
-
18
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... -
19
gabipb
A GPU-accelerated boundary integral Poisson-Boltzmann solver
This software package presents a GPU-accelerated direct-sum boundary integral method to solve the linear Poisson-Boltzmann (PB) equation. In our method, a well-posed boundary integral formulation is used to ensure the fast convergence of Krylov subspace based linear algebraic solver such as the GMRES. The molecular surfaces are discretized with flat triangles and centroid collocation. To speed up our method, we take advantage of the parallel nature of the boundary integral formulation... -
20
PCramer
Dense linear solver utilizing Cramer's rule in parallel
This code provides a linear solver based on a parallel application of Cramer's rule. The programming was done in 'C' leveraging the MPI-CH2 libraries for message passing between nodes. This implementation is for dense linear systems and all calculations are done with doubles. -
21
Simple SUVAT Solver
A simple solver for simple SUVAT questions
This is the first release of the SUVAT Solver 1.0. If you find errors either drop us a line and explain or your more than welcome to the files to have a look yourself! -
22
hobipb
a higher-order boundary integral Poisson-Boltzmann solver
This software contains the parallel higher-order boundary integral method to solve the linear Poisson-Boltzmann (PB) equation. A well-posed boundary integral formulation is used to ensure the fast convergence of Krylov subspace linear solver such as GMRES. The molecular surfaces are first discretized with flat triangles and then converted to curved riangles with the assistance of normal information at vertices. To maintain the desired accuracy, four-point Gauss-Radau quadratures are used... -
23
Quick solver for Bakers Game. The code is ucrrently only for Baker's game "Easy" ( can move columns of matched cards of any legnth, regardless of available reserve spots ). Code can be easily changed to support both.
-
24
CramerAlgorithm
Dense linear solver based on Cramer's Rule and Chio condensation
CramerAlgorithm is a ‘C’ program that solves a system of linear equations to find a solution vector. The program is structured to take input in the same manner as the DGESV routine from LAPACK. It computes A * x = B, where A is an NxN matrix, B is a solution vector and x is the solution vector provided by the program. The algorithm is parallel in nature and this version utilizes threads for a minimal level of parallelism. It also utilizes SIMD (Single instruction, multiple data – SSE2)... -
25
The sudoku solver program is a simple command line driven program that solves sudoku puzzles by taking its input from a comma separated input file and printing results to the screen.