Results 51 to 60 of about 246,520 (298)
In‐Memory Continuous‐Time SAT Solver Based on Bidirectional 11‐T SRAM Macro
Advanced Intelligent SystemsWe propose a scalable continuous‐time (CT) Boolean satisfiability (SAT) solver based on a bidirectional 11‐T SRAM macro for solving hard SAT instances in the analog domain.
Dongseok Kwon +3 more
doaj +1 more source
Connecting ABT with a SAT Solver
, 2016 Many real-world problems are encoded into SAT instances and efficiently solved by CDCL (Conflict-Driven Clause Learning) SAT solvers. However, some scenarios require distributed problem solving approaches. Privacy is often the main reason. This motivates the need to solve distributed SAT problems We analyze how this problem can be tacked in an ...
Jesús Giráldez-Cru +2 more
openaire +2 more sources
FEBS Letters, EarlyView.CT10 regulator of kinase (CRK) and CRK‐Like (CRKL) are signaling adaptors driving cell adhesion, motility, differentiation, and proliferation. SH2‐domain containing (SH) proteins are enriched in YXXP motifs which when phosphorylated create preferred binding sites for CRK family SH2 domains.
Phoebe M. Cousens +8 more
wiley +1 more source
, 2007 . We introduce SAT(ID) and explain its relation both to SAT and to ASP. We then describe the SAT(ID) solver MidL. We outline its design and algorithms, and finally establish its performance by experiment.
Maarten Mariën +2 more
core +1 more source
Reconstructing enzyme evolution by protein engineering
FEBS Letters, EarlyView.Natural enzyme evolution can be retraced by protein engineering methods such as directed evolution, rational design, and ancestral sequence reconstruction. These approaches reveal how enzymes emerged from ligand‐binding scaffolds, developed varying substrate preferences, formed oligomeric complexes, adapted to environmental changes, and evolved novel ...
Lukas Drexler +2 more
wiley +1 more source
D2-SYNCHRONIZATION IN NONDETERMINISTIC AUTOMATA
Ural Mathematical Journal, 2018 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
Dynamic Initial Weight Assignment for MaxSAT
Algorithms, 2021 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
Conserved binding mode but diverse interfaces of MreC‐PBP2 interactions
FEBS Letters, EarlyView.The crystal structure of abMreC reveals a conserved two β‐barrel architecture and provides structural insights into its role within the bacterial elongasome. The abMreC–abPBP2 complex model identifies the molecular basis of MreC‐mediated PBP2 recognition, contributing to the regulation of peptidoglycan synthesis.
Hyunseok Jang +4 more
wiley +1 more source
Theory Propagation and Reification [PDF]
, 2015 SAT Modulo Theories (SMT) is the problem of determining the satisfiability of a formula in which constraints, drawn from a given constraint theory T, are composed with logical connectives.
Howe, J. M. +5 more
core +1 more source
Engineering peptides into antibodies—opportunities and strategies for therapeutic innovation
FEBS Letters, EarlyView.Peptides and antibodies occupy complementary therapeutic niches. Peptides recognize difficult targets in a compact format, while antibodies add specificity, long half‐life, and effector functions. This review examines strategies that merge both modalities—peptide grafting into loops, terminal and Fc fusions, and bioconjugation—highlighting how ...
Jinling Wang +2 more
wiley +1 more source