Results 241 to 250 of about 3,671,128 (304)

A multi-factor data mining and transformer-based predictive modeling approach for career success using educational and behavioral traits. [PDF]

Sci Rep
Zihan Z.
europepmc   +1 more source

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

Nat Commun
Nikhar S, Kannan S, Aadit NA, Chowdhury S, Camsari KY.   +4 more
europepmc   +1 more source

Flow rate selection depends on the size of allergen particles to achieve optimal nasal irrigation. [PDF]

Sci Rep
Liu Y, Sui X, Yang Q, Jie Z, Yang Z, Feng W, Zhou R.   +6 more
europepmc   +1 more source

Formal verification of bioinformatics software using model checking and theorem proving. [PDF]

Brief Bioinform
Weerasena H, Jayasena A, Boucher C, Mishra P.   +3 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

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

Accelerating a continuous-time analog SAT solver using GPUs

Computer Physics Communications, 2020
Recently, a continuous-time, deterministic analog solver based on ordinary differential equations (CTDS) was introduced, to solve Boolean satisfiability (SAT), a family of discrete constraint satisfaction problems.
F. Molnár, Shubha R. Kharel, X. Hu, Z. Toroczkai   +3 more
semanticscholar   +3 more sources

Optimizing a Verified SAT Solver

NASA Formal Methods, 2019
In previous work, I verified a SAT solver with dedicated imperative data structures, including the two-watched-literal scheme. In this paper, I extend this formalization with four additional optimizations. The approach is still based on refining an abstract calculus to a deterministic program.
M. Fleury
openaire   +4 more sources

Parallel SAT Solver Selection and Scheduling

International Conference on Principles and Practice of Constraint Programming, 2012
Combining differing solution approaches by means of solver portfolios has proven as a highly effective technique for boosting solver performance. We consider the problem of generating parallel SAT solver portfolios. Our approach is based on a recently introduced sequential SAT solver portfolio that excelled at the last SAT competition.
Malitsky Y., Sabharwal A., Samulowitz H., Sellmann M.   +3 more
openaire   +2 more sources