Results 81 to 90 of about 246,520 (298)
A Resolution-Based Interactive Proof System for UNSAT [PDF]
Modern SAT or QBF solvers are expected to produce correctness certificates. However, certificates have worst-case exponential size (unless NP=coNP), and at recent SAT competitions the largest certificates of unsatisfiability are starting to reach ...
Philipp Czerner +3 more
doaj +1 more source
Leucine‐rich glioma inactivated 1 (LGI1) is a ganglioside‐binding protein
Neuronal hyperexcitability associated with a decrease/absence of the extracellular protein LGI1 has been suggested to be primarily due to the downregulation of Kv1 channel expression. The molecular mechanisms underlying this decrease have not yet been elucidated.
Kévin Debreux +7 more
wiley +1 more source
Effective Partitioning Method With Predictable Hardness for CircuitSAT
Many industrial verification problems are solved via reduction to CircuitSAT (curcuit satisfibiliaty). It is often the case that the resulting SAT instances are very hard and require the use of parallel computing to be solved in reasonable time.
Konstantin Chukharev +5 more
doaj +1 more source
Paralleler SAT-Solver mit Konfliktklauselbehandlung
In diesem Paper wird ein paralleler SAT-Solver beschrieben, der durch Multithreading parallelisiert wird. Dabei ist das Besondere, dass verschiedene Solverparameter untersucht werden und ein Konfliktklauselhandling implementiert wird, welches auf einer ...
Tietjen, Jil
core +1 more source
A context‐dependent modulatory role for eIF6 in acquired resistance to vemurafenib in melanoma
Acquired resistance to vemurafenib upregulates the translation factor eIF6 in melanoma cells. Silencing eIF6 in resistant cells reduces proliferation and partially restores drug sensitivity, whereas its overexpression increases sensitivity across melanoma lines regardless of BRAF status, via modulation of mTOR, S6K, and MAPK signaling.
George Kyriakopoulos +9 more
wiley +1 more source
Lynx: A Programmatic SAT Solver for the RNA-folding Problem [PDF]
15th International Conference, Trento, Italy, June 17-20, 2012. ProceedingsThis paper introduces Lynx, an incremental programmatic SAT solver that allows non-expert users to introduce domain-specific code into modern conflict-driven clause-learning (CDCL)
Solar-Lezama, Armando +11 more
core +1 more source
Smaller is better: nanobodies meet NMR
Nanobodies are single‐domain antigen‐binding fragments derived from camelid heavy chain antibodies. Their small size, high stability, and exceptional specificity make nanobodies uniquely useful probes for NMR studies of protein dynamics, transient conformational states, and protein–protein interactions.
Oleg Y. Dmitriev
wiley +1 more source
Assessment of Quantum Annealing for the Construction of Satisfiability Filters
Satisfiability filters, introduced by S. A. Weaver et al. in 2014, are a new and promising type of filters to address set membership testing. In order to construct satisfiability filters, it is necessary to find disparate solutions to hard random $k ...
Marlon Azinović, Daniel Herr, Bettina Heim, Ethan Brown, Matthias Troyer
doaj +1 more source
Transient oligomers formed by intrinsically disordered proteins may be ‘invisible’ to direct detection yet remain accessible to solution NMR through equilibrium‐exchange measurements and pressure‐jump experiments. Complementary methods report on mass, stoichiometry, selected distance distributions, morphology, and internal packing.
Martin D. Gelenter, Ad Bax
wiley +1 more source
SAT Algorithm Based on Symbolic Simulation and Variable Partitions
:To solve the problem that SAT solvers usually has excessive backtraces during assigning binary values to an unassigned variables, a new SAT solver based on symbolic simulation and variable partition, which lower not only the number of backtrack but the ...
doaj

