Results 281 to 290 of about 3,677,634 (349)

All-to-all reconfigurability with sparse and higher-order Ising machines. [PDF]

open access: yesNat Commun
Nikhar S   +4 more
europepmc   +1 more source

Two New Findings on the Fair Distribution of Goods through SAT Solving

open access: green
Shreyas Srinivas   +3 more
openalex   +1 more source

An Extensible SAT-solver

International Conference on Theory and Applications of Satisfiability Testing, 2004
In this article, we present a small, complete, and efficient SAT-solver in the style of conflict-driven learning, as exemplified by Chaff. We aim to give sufficient details about implementation to enable the reader to construct his or her own solver in a very short time.This will allow users of SAT-solvers to make domain specific extensions or ...
Niklas Eén, Niklas Sörensson
openaire   +2 more sources

HordeSat: A Massively Parallel Portfolio SAT Solver

open access: yesInternational Conference on Theory and Applications of Satisfiability Testing, 2015
A simple yet successful approach to parallel satisfiability (SAT) solving is to run several different (a portfolio of) SAT solvers on the input problem at the same time until one solver finds a solution.
Tomás Balyo, P. Sanders, C. Sinz
semanticscholar   +3 more sources

Home - About - Disclaimer - Privacy