Search Results for "parallel-sudoku-solver"
Sort By:
Showing 167 open source projects for "parallel-sudoku-solver"
View related business solutions-
New Plans, same great Auth0 | Auth0 by OktaIn our new Free Plan, you'll receive more MAUs than ever. You'll also be able to add Passwordless authentication, use your own custom domain, and more. Our expanded Paid Plans include increased connections, more MFA offerings, and more. Check out what's new.
-
Free CRM Software With Something for EveryoneThink CRM software is just about contact management? Think again. HubSpot CRM has free tools for everyone on your team, and it’s 100% free. Here’s how our free CRM solution makes your job easier.
-
1
Greenplum Database
Massive parallel data platform for analytics, machine learning and AI
Rapidly create and deploy models for complex applications in cybersecurity, predictive maintenance, risk management, fraud detection, and many other areas. With its unique cost-based query optimizer designed for large-scale data workloads, Greenplum scales interactive and batch-mode analytics to large datasets in the petabytes without degrading query performance and throughput. Based on PostgreSQL, Greenplum provides you with more control over the software you deploy, reducing vendor... -
2
The Julia Programming Language
High-level, high-performance dynamic language for technical computing
Julia is a fast, open source high-performance dynamic language for technical computing. It can be used for data visualization and plotting, deep learning, machine learning, scientific computing, parallel computing and so much more. Having a high level syntax, Julia is easy to use for programmers of every level and background. Julia has more than 2,800 community-registered packages including various mathematical libraries, data manipulation tools, and packages for general purpose computing... -
3
101-0250-00
ETH course - Solving PDEs in parallel on GPUs
This course aims to cover state-of-the-art methods in modern parallel Graphical Processing Unit (GPU) computing, supercomputing and code development with applications to natural sciences and engineering. -
4
XCharts
A charting and data visualization library for Unity
... chart, scatter chart, heat map, ring chart, candlestick chart, polar coordinate, parallel coordinate and so on. Supports 3D column charts, funnel charts, pyramids, dashboards, water level charts, pictographic column charts, Gantt charts, rectangular tree charts and other extended charts. Line graphs such as line graphs, curve graphs, area graphs, and stepped line graphs are supported. -
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.
-
5
TIGRE
TIGRE: Tomographic Iterative GPU-based Reconstruction Toolbox
TIGRE is an open-source toolbox for fast and accurate 3D tomographic reconstruction for any geometry. Its focus is on iterative algorithms for improved image quality that have all been optimized to run on GPUs (including multi-GPUs) for improved speed. It combines the higher-level abstraction of MATLAB or Python with the performance of CUDA at a lower level in order to make it both fast and easy to use. TIGRE is free to download and distribute: use it, modify it, add to it, and share it. Our... -
6
ParallelStencil.jl
Package for writing high-level code for parallel stencil computations
ParallelStencil empowers domain scientists to write architecture-agnostic high-level code for parallel high-performance stencil computations on GPUs and CPUs. Performance similar to CUDA C / HIP can be achieved, which is typically a large improvement over the performance reached when using only CUDA.jl or AMDGPU.jl GPU Array programming. For example, a 2-D shallow ice solver presented at JuliaCon 2020 [1] achieved a nearly 20 times better performance than a corresponding GPU Array programming... -
7
XGBoost
Scalable and Flexible Gradient Boosting
XGBoost is an optimized distributed gradient boosting library, designed to be scalable, flexible, portable and highly efficient. It supports regression, classification, ranking and user defined objectives, and runs on all major operating systems and cloud platforms. XGBoost works by implementing machine learning algorithms under the Gradient Boosting framework. It also offers parallel tree boosting (GBDT, GBRT or GBM) that can quickly and accurately solve many data science problems. XGBoost... -
8
SCIP.jl
Julia interface to SCIP solver
SCIP.jl is a Julia interface to the SCIP solver. This wrapper is maintained by the SCIP project with the help of the JuMP community. -
9
HiGHS.jl
Julia wrapper for the HiGHS solver
HiGHS.jl is a wrapper for the HiGHS solver. -
Intelligent network automation for businesses and organizationsBackBox seamlessly integrates with network monitoring and NetOps platforms and automates configuration backups, restores, and change detection. BackBox also provides before and after config diffs for change management, and automated remediation of discovered network security issues.
-
10
VoronoiFVM.jl
Solution of nonlinear multiphysics partial differential equations
Solver for coupled nonlinear partial differential equations (elliptic-parabolic conservation laws) based on the Voronoi finite volume method. It uses automatic differentiation via ForwardDiff.jl and DiffResults.jl to evaluate user functions along with their jacobians and calculate derivatives of solutions with respect to their parameters. -
11
FileTrees.jl
Parallel file processing made easy
Easy everyday parallelism with a file tree abstraction. Read a directory structure as a Julia data structure, (lazy-)load the files, apply map and reduce operations on the data while not exceeding available memory if possible. Make up a file tree in memory, create some data to go with each file (in parallel), write the tree to disk (in parallel). FileTrees is a set of tools to lazy-load, process and save file trees. Built-in parallelism allows you to max out all threads and processes that Julia... -
12
ProxSDP.jl
Semidefinite programming optimization solver
ProxSDP is an open-source semidefinite programming (SDP) solver based on the paper "Exploiting Low-Rank Structure in Semidefinite Programming by Approximate Operator Splitting". The main advantage of ProxSDP over other state-of-the-art solvers is the ability to exploit the low-rank structure inherent to several SDP problems. -
13
Circuitscape.jl
Algorithms from circuit theory to predict connectivity
Circuitscape is an open-source program that uses circuit theory to model connectivity in heterogeneous landscapes. Its most common applications include modeling the movement and gene flow of plants and animals, as well as identifying areas important for connectivity conservation. The new Circuitscape is built entirely in the Julia language, a new programming language for technical computing. Julia is built from the ground up to be fast. As such, this offers a number of advantages over the... -
14
Tulip.jl
Interior-point solver in pure Julia
Tulip is an open-source interior-point solver for linear optimization, written in pure Julia. It implements the homogeneous primal-dual interior-point algorithm with multiple centrality corrections and therefore handles unbounded and infeasible problems. Tulip’s main feature is that its algorithmic framework is disentangled from linear algebra implementations. This allows to seamless integration of specialized routines for structured problems. -
15
OpenCL.jl
OpenCL Julia bindings
Julia interface for the OpenCL parallel computation API. This package aims to be a complete solution for OpenCL programming in Julia, similar in scope to PyOpenCL for Python. It provides a high level API for OpenCL to make programing hardware accelerators, such as GPUs, FPGAs, and DSPs, as well as multicore CPUs much less onerous. -
16
SciMLBenchmarks.jl
Benchmarks for scientific machine learning (SciML) software
SciMLBenchmarks.jl holds webpages, pdfs, and notebooks showing the benchmarks for the SciML Scientific Machine Learning Software ecosystem. -
17
NonlinearSolve.jl
High-performance and differentiation-enabled nonlinear solvers
... linear solvers, along with the ability to use sparse automatic differentiation for Jacobian construction and Jacobian-vector products. NonlinearSolve.jl interfaces with other packages of the Julia ecosystem to make it easy to test alternative solver packages and pass small types to control algorithm swapping. It also interfaces with the ModelingToolkit.jl world of symbolic modeling to allow for automatically generating high-performance code. -
18
Gaius.jl
Divide and Conquer Linear Algebra
Gaius.jl is a multi-threaded BLAS-like library using a divide-and-conquer strategy to parallelism, and built on top of the fantastic LoopVectorization.jl. Gaius spawns threads using Julia's depth-first parallel task runtime and so Gaius's routines may be fearlessly nested inside multi-threaded Julia programs. Gaius is not stable or well-tested. Only use it if you're adventurous. -
19
DiffOpt.jl
Differentiating convex optimization programs w.r.t. program parameters
DiffOpt.jl is a package for differentiating convex optimization programs (JuMP.jl or MathOptInterface.jl models) with respect to program parameters. Note that this package does not contain any solver. This package has two major backends, available via the reverse_differentiate! and forward_differentiate! methods, to differentiate models (quadratic or conic) with optimal solutions. Differentiable optimization is a promising field of convex optimization and has many potential applications in game... -
20
EAGO.jl
A development environment for robust and global optimization
EAGO is an open-source development environment for robust and global optimization in Julia. EAGO is a deterministic global optimizer designed to address a wide variety of optimization problems, emphasizing nonlinear programs (NLPs), by propagating McCormick relaxations along the factorable structure of each expression in the NLP. Most operators supported by modern automatic differentiation (AD) packages (e.g., +, sin, cosh) are supported by EAGO and a number of utilities for sanitizing... -
21
BlockArrays.jl
BlockArrays for Julia
... BlockArray stores each block contiguously while the type PseudoBlockArray stores the full matrix contiguously. This means that BlockArray supports fast noncopying extraction and insertion of blocks while PseudoBlockArray supports fast access to the full matrix to use in for example a linear solver. -
22
Coluna.jl
Branch-and-Price-and-Cut in Julia
Coluna is a branch-and-price-and-cut framework written in Julia. You write an original MIP that models your problem using the JuMP modeling language and our specific extension BlockDecomposition offers a syntax to specify the problem decomposition. Then, Coluna reformulates the original MIP and optimizes the reformulation using the algorithms you choose. Coluna aims to be very modular and tweakable so that you can define the behavior of your customized branch-and-price-and-cut algorithm. -
23
Sundials.jl
Julia interface to Sundials, including a nonlinear solver
This is a suite for numerically solving differential equations written in Julia and available for use in Julia, Python, and R. The purpose of this package is to supply efficient Julia implementations of solvers for various differential equations. -
24
PartitionedArrays.jl
Vectors and sparse matrices partitioned into pieces
This package provides distributed (a.k.a. partitioned) vectors and sparse matrices in Julia. See the documentation for further details. -
25
LinearSolve.jl
High-Performance Unified Interface for Linear Solvers in Julia
LinearSolve.jl is a unified interface for the linear solving packages of Julia. It interfaces with other packages of the Julia ecosystem to make it easy to test alternative solver packages and pass small types to control algorithm swapping. It also interfaces with the ModelingToolkit.jl world of symbolic modeling to allow for automatically generating high-performance code. Performance is key: the current methods are made to be highly performant on scalar and statically sized small problems...