Results 31 to 40 of about 1,600,173 (280)

Biased random satisfiability problems: From easy to hard instances

open access: yes, 2005
In this paper we study biased random K-SAT problems in which each logical variable is negated with probability $p$. This generalization provides us a crossover from easy to hard problems and would help us in a better understanding of the typical ...
A. Ramezanpour   +3 more
core   +1 more source

Using Sat solvers for synchronization issues in partial deterministic automata [PDF]

open access: yes, 2019
We approach the task of computing a carefully synchronizing word of minimum length for a given partial deterministic automaton, encoding the problem as an instance of SAT and invoking a SAT solver.
A Roman   +32 more
core   +1 more source

Clinical profile and growth pattern of children with congenital adrenal hyperplasia attending endocrine clinic, in a tertiary care center, South India

open access: yesNational Journal of Physiology, Pharmacy and Pharmacology
Background: Congenital adrenal hyperplasia (CAH) is a group of autosomal recessive disorders that result from the deficiency of one of several enzymes involved in the steroidogenic pathway for cortisol or aldosterone biosynthesis.
Asheem Kudukkil Nediyarathil   +2 more
doaj   +1 more source

Transient Neonatal Hyperparathyroidism Unfolding a Noteworthy Cause: A Series of Four Cases [PDF]

open access: yesJournal of Clinical and Diagnostic Research
Transient Neonatal Hyperparathyroidism (TNHP) is an abnormal bone disorder caused by impaired maternal-foetal calcium transport across the placenta, leading to inadequate foetal bone mineralisation.
AO Vinitha   +4 more
doaj   +1 more source

Proteus: A Hierarchical Portfolio of Solvers and Transformations

open access: yes, 2014
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

Integrating Conflict Driven Clause Learning to Local Search

open access: yes, 2009
This article introduces SatHyS (SAT HYbrid Solver), a novel hybrid approach for propositional satisfiability. It combines local search and conflict driven clause learning (CDCL) scheme. Each time the local search part reaches a local minimum, the CDCL is
Bertrand Mazure   +5 more
core   +3 more sources

European Standard Clinical Practice Guideline and EXPeRT Recommendations for the Diagnosis and Management of Gastroenteropancreatic Neuroendocrine Neoplasms in Children and Adolescents

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Pediatric gastroenteropancreatic neuroendocrine neoplasms (GEP‐NENs) are extremely rare and clinically heterogeneous. Management has largely been extrapolated from adult practice. This European Standard Clinical Practice Guideline (ESCP), developed by the EXPeRT network in collaboration with adult NEN experts, provides (adult) evidence ...
Michaela Kuhlen   +23 more
wiley   +1 more source

Analysis of the cryptographic strength of the SHA-256 hash function using the SAT approach

open access: yesНаучно-технический вестник информационных технологий, механики и оптики
Cryptographic hash functions play a significant role in modern information security systems by ensuring data integrity and enabling efficient data compression. One of the most important and widely used cryptographic hash functions is SHA-256 that belongs
V. V. Davydov   +3 more
doaj   +1 more source

Waist Circumference predicting Cardiovascular Disease in Korean Men and Women [PDF]

open access: yes, 2010
Objective: Obesity and cardiovascular disease (CVD) are closely related and have become increasingly prevalent in Korea. Asians are more prone to obesity-related co-morbidities than Caucasians, even at lower body mass index (BMI) and/or smaller waist ...
Sat Byul Park, Sun Ha Jee
core   +1 more source

Classical-Quantum Mixing in the Random 2-Satisfiability Problem

open access: yes, 2015
Classical satisfiability (SAT) and quantum satisfiability (QSAT) are complete problems for the complexity classes NP and QMA which are believed to be intractable for classical and quantum computers, respectively.
Laumann, C. R.   +2 more
core   +1 more source

Home - About - Disclaimer - Privacy