Results 241 to 250 of about 3,379,264 (310)

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

SAT-to-SAT: Declarative Extension of SAT Solvers with New Propagators

, 2020
Janhunen Tomi, Tasharrofi Shahab
openaire   +1 more source

Advanced Flame Retardant Strategies and Fire Performance Assessment for Safer Photovoltaics in Buildings: A Two‐Part Review

Advanced Functional Materials, EarlyView.
The integration of photovoltaic (PV) systems into building structures introduces distinct fire risks with critical implications for occupant safety. This review examines the key fire hazards associated with PV implementation and explores mitigation strategies, including flame‐retardant additives.
Florian Ollagnon, Olaia Aurrekoetxea‐Arratibel, Emma Gottis, Heng‐Yu Li, Xabier Olano‐Azkune, Matthieu Despeisse, Antonin Faes, Christophe Ballif   +7 more
wiley   +1 more source

Anesthesia Practice Shift Scheduling With a Generative Deep Learning Model. [PDF]

Cureus
Emeneker W, Heape S, Hartman G, Gillespie M, Perkins S.   +4 more
europepmc   +1 more source

Optimization by decoded quantum interferometry. [PDF]

Nature
Jordan SP, Shutty N, Wootters M, Zalcman A, Schmidhuber A, King R, Isakov SV, Khattar T, Babbush R.   +8 more
europepmc   +1 more source

Perception-based constraint solving for sudoku images. [PDF]

Constraints
Mulamba M, Mandi J, Mahmutoğulları Aİ, Guns T.   +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, 2003
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 ...
N. Eén, Niklas Sörensson
semanticscholar   +2 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
semanticscholar   +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.
Yuri Malitsky, Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann   +3 more
semanticscholar   +2 more sources