Search Results for "parallel-sudoku-solver" - Page 61
Sort By:
Showing 2100 open source projects for "parallel-sudoku-solver"
View related business solutions-
Go from Code to Production URL in SecondsSkip the Kubernetes configs. Cloud Run handles HTTPS, scaling, and infrastructure automatically. Two million requests free per month.
-
Ship Agents FasterGemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
-
1
Implementation of paralell partitioning algorithms achieving an optimal number of comparisons. See L. Frias and J. Petit. Parallel partition revisited. http://dx.doi.org/10.1007/978-3-540-68552-4_11 for further reference.
-
2
The PTask library aims to simplify the implementation of parallelized algorithms. The base concept is to define descriptions of your algorithms with their parallel and serial sections and then execute them on a fixed number of worker threads.
-
3
-
4
The openLBMflow is an fast fluid flow solver based on Lattice Boltzmann Method. Main future are 2D and 3D code, single and multiphase models, Output data in VTK format can be directly open in Paraview. Download Windows or Linux binary version now.
-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
5
PyMW is a Python module for parallel master-worker computing in a variety of environments. With the PyMW module, users can write a single program that scales from multicore machines to global computing platforms.
-
6
The DotNet Nurikabe Solver is a C# solver for Nurikabe running on Framework 3.5. The primary design goal is speed.
-
7
Easy to use download manager written in Java, which can be used as a standalone application or embedded as an Applet. Supports multiple parallel downloads, downloads in chunks, resuming downloads, auto-retries after errors and a customizable UI.
-
8
Sequential and parallel implementation of string quicksorts(-select) . Articles: On the number of string lookups in BSTs (and related algorithms) with digital access/ Combining digital access and parallel partition for quicksort and quickselect.
-
9
SDCal is a fast sudoku-calculator. SDCal Pro provides a gtk+ interface for SDCal. Now SDCal will support editing sudoku, solving sudoku step-by-step, estimating difficulty and creating nice sudoku problems!
-
Demo Series - Small Business Backup By VeeamWatch this on-demand demo series and learn how to protect your Microsoft 365 data with clear, simple, actionable steps that are easy to implement for businesses of all sizes.
-
10
jAlgorithms is a project mainly for educational purposes. It contains some of the popular algorithms and data structures.
-
11
-
12
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.
-
13
Parallel and atomic backup utility with web-based management. Written in PHP for simplicity in modifying and extending the framework. Multithreads not-so-multithreaded processes like rdiff-backup, rsync and SSH to decrease backup windows.
-
14
JSudognu creates, rates, solves and prints sudokus. Features include creation of symmetric sudokus, printing to postscript printers and filtering sudoku databases for solution techniques. JSudognu is a front end for sudognu.
-
15
This is a FreeCell solitaire game solver written in the Java. It is fast and capable - it solves all of the first million Microsoft deals in about 4 hours - 99.99% of them in less than a second, and no deal takes more than 1 minute.
-
16
The aim of the PL-PSF project is to create a generic domain-independent combinatorial problem solver. It uses a petri-nets based model to represent the problems and problem decomposition/abstraction with graph topology analysis to solve them.
-
17
BSPonMPI is an implementation of the BSPlib standard on top of MPI. Both MPI and BSPlib are API's of communication routines meant for parallel computing, but BSPlib is easier to learn and its performance easier to predict.
-
18
The general triangle solver. It computes all solutions for a triangle specified by combination of sides, angles, altitudes, medians, angle bisectors, area, radius of circumscribed and inscribed circle, sum a+b, perimeter and difference of alpha-beta.
-
19
The Decision Procedure Toolkit (DPT) is a system of cooperating decision procedures for answering satisfiability queries. The DPT implementation in OCaml comprises a DPLL-style SAT solver with theory-specific decision procedures.
-
20
-
21
A 2-D inviscid flow and adjoint solver on unstructured triangular grids. It makes use of a vertex-centroid finite volume scheme which is second order accurate. The adjoint solver is developed using the automatic differentiation tool called TAPENADE. Code has been moved to https://github.com/cpraveen/euler2d
-
22
A modular SAT solver based on Minisat. The modules are described in XML-files, which are processed by a perl script; thus generating n-solvers.
-
23
Solver for the Data Compaction Problem (dcp) for static test compaction and some specific bionformatic issues. Contains code, charts, tables and test data.
-
24
Jdoku is a sudoku solver made in java. It implements the swing API. The sudoku solver applies two logics for now. Try it. I got board solving news paper sudoku after creating this!
-
25
Groom is a full Java lightweight webserver. Written in pure Java 1.4 by using only standard packages, it can thus run with Sun JRE but also with the GNU Classpath on a great number of plateforms that support java.
