Results 51 to 60 of about 3,671,128 (304)
Benchmark of quantum-inspired heuristic solvers for quadratic unconstrained binary optimization
Recently, inspired by quantum annealing, many solvers specialized for unconstrained binary quadratic programming problems have been developed. For further improvement and application of these solvers, it is important to clarify the differences in their ...
Hiroki Oshiyama, Masayuki Ohzeki
doaj +1 more source
Dynamic Initial Weight Assignment for MaxSAT
The Maximum Satisfiability (Maximum Satisfiability (MaxSAT)) approach is the choice, and perhaps the only one, to deal with most real-world problems as most of them are unsatisfiable.
Abdelraouf Ishtaiwi, Qasem Abu Al-Haija
doaj +1 more source
On Computing Minimum Unsatisfiable Cores [PDF]
Certifying the correctness of a SAT solver is straightforward for satisfiable instances of SAT. Given
Lynce, I., Marques-Silva, J. P.
core +2 more sources
Proteus: A Hierarchical Portfolio of Solvers and Transformations
In recent years, portfolio approaches to solving SAT problems and CSPs have become increasingly common. There are also a number of different encodings for representing CSPs as SAT instances. In this paper, we leverage advances in both SAT and CSP solving
B.A. Huberman +11 more
core +1 more source
Mapping the evolution of mitochondrial complex I through structural variation
Respiratory complex I (CI) is crucial for bioenergetic metabolism in many prokaryotes and eukaryotes. It is composed of a conserved set of core subunits and additional accessory subunits that vary depending on the organism. Here, we categorize CI subunits from available structures to map the evolution of CI across eukaryotes. Respiratory complex I (CI)
Dong‐Woo Shin +2 more
wiley +1 more source
In situ molecular organization and heterogeneity of the Legionella Dot/Icm T4SS
We present a nearly complete in situ model of the Legionella Dot/Icm type IV secretion system, revealing its central secretion channel and identifying new components. Using cryo‐electron tomography with AI‐based modeling, our work highlights the structure, variability, and mechanism of this complex nanomachine, advancing understanding of bacterial ...
Przemysław Dutka +11 more
wiley +1 more source
D2-SYNCHRONIZATION IN NONDETERMINISTIC AUTOMATA
We approach the problem of computing a D2-synchronizing word of minimum length for a given nondeterministic automaton via its encoding as an instance of SAT and invoking a SAT solver.
Hanan Shabana
doaj +1 more source
fbSAT: Automatic Inference of Minimal Finite-State Models of Function Blocks Using SAT Solver
Finite-state models are widely used in software engineering, especially in the development of control systems. In control applications, such models are often developed manually, which can make it difficult to keep them up to date.
Konstantin Chukharev, Daniil Chivilikhin
doaj +1 more source
Automating Boolean Set Operations in Mizar Proof Checking with the Aid of an External SAT Solver
In this paper we present the results of an experiment with employing an external SAT solver to strengthen the notion of obviousness of the Mizar proof checker. The presented extension of the Mizar system is based on a version of MiniSAT, called Logic2CNF.
Adam Naumowicz
semanticscholar +1 more source
Sequence determinants of RNA G‐quadruplex unfolding by Arg‐rich regions
We show that Arg‐rich peptides selectively unfold RNA G‐quadruplexes, but not RNA stem‐loops or DNA/RNA duplexes. This length‐dependent activity is inhibited by acidic residues and is conserved among SR and SR‐related proteins (SRSF1, SRSF3, SRSF9, U1‐70K, and U2AF1).
Naiduwadura Ivon Upekala De Silva +10 more
wiley +1 more source

