Results 281 to 290 of about 3,677,634 (349)
A multi-factor data mining and transformer-based predictive modeling approach for career success using educational and behavioral traits. [PDF]
Zihan Z.
europepmc +1 more source
All-to-all reconfigurability with sparse and higher-order Ising machines. [PDF]
Nikhar S +4 more
europepmc +1 more source
Two New Findings on the Fair Distribution of Goods through SAT Solving
Shreyas Srinivas +3 more
openalex +1 more source
Flow rate selection depends on the size of allergen particles to achieve optimal nasal irrigation. [PDF]
Liu Y +6 more
europepmc +1 more source
Solving and generating large Sudoku puzzles by reduction to SAT
Mirko Stojadinović
openalex +1 more source
Formal verification of bioinformatics software using model checking and theorem proving. [PDF]
Weerasena H +3 more
europepmc +1 more source
SAT-to-SAT: Declarative Extension of SAT Solvers with New Propagators
Janhunen Tomi, Tasharrofi Shahab
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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
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
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

