نتایج جستجو برای: sat

تعداد نتایج: 12361  

2000
Holger H. Hoos

SATLIB is an online resource for SAT-related research established in June 1998. Its core components, a benchmark suite of SAT instances and a collection of SAT solvers, aim to facilitate empirical research on SAT by providing a uniform test-bed for SAT solvers along with freely available implementations of high-performing SAT algorithms. In this article, we give an overview of SATLIB; in partic...

1999
Darrell Whitley

The majority of ensemble creation algorithms use the full set of available features for its task. Feature selection for ensemble creation has not been carried out except for some work on random feature selection. In this paper we focus our attention on genetic based feature selection for ensemble creation. Our approach uses a genetic algorithm to search over the entire feature space. Subsets of...

Journal: :Developmental Cell 2009

Journal: :Combinatorics, Probability & Computing 2023

Abstract In this paper we study a variation of the random $k$ -SAT problem, called polarised -SAT, which contains both classical model and version monotone another well-known NP-complete SAT. there is polarisation parameter $p$ , in half clauses each variable occurs negated with probability pure otherwise, while other probabilities are interchanged. For $p=1/2$ get model, at extreme have fully ...

2009
Martin Ellmerer Martin Haluzik Jan Blaha Jaromir Kremen Stepan Svacina Andreas Plasnik Dimas Ikeoka Manfred Bodenlenz Lukas Schaupp Johannes Plank Thomas R. Pieber

Minimally invasive techniques to access subcutaneous adipose tissue for glucose monitoring are successfully applied in type1 diabetic and critically ill patients. During critical illness, the addition of a lactate sensor might enhance prognosis and early intervention. Our objective was to evaluate SAT as a site for lactate measurement in critically ill patients. In 40 patients after major cardi...

2008
Ştefan Andrei Albert M.K. Cheng Gheorghe Grigoraş Lawrence J. Osborne

Theorem proving is a challenging task for formal verification of systems. There exist many efforts to efficiently solve this problem, based for example on rewriting rules and/or SAT-based techniques. We propose an alternative of SAT-based techniques by using instead a counting SAT-based technique (denoted also #SAT). A SAT solver tests if a propositional formula F has at least one truth assignm...

Journal: :Journal on Satisfiability, Boolean Modeling and Computation 2019

Journal: :Random Structures & Algorithms 2021

2012
Georg Weissenbacher Sharad Malik

Contemporary satisfiability solvers are the corner-stone of many successful applications in domains such as automated verification and artificial intelligence. The impressive advances of SAT solvers, achieved by clever engineering and sophisticated algorithms, enable us to tackle Boolean Satisfiability (SAT) problem instances with millions of variables – which was previously conceived as a hope...

Journal: :The Onderstepoort journal of veterinary research 2006
J M K Hyera M Letshwenyo K B Monyame G Thobokwe A R Pilane N Mapitse E K Baipoledi

A serological survey was conducted in apparently healthy, unvaccinated indigenous Tswana goats and sheep in Kasane, Maun and Shakawe districts in northwestern Botswana in order to determine in these animals, the levels of exposure to the South African Territories (SAT) serotypes: SAT 1, SAT 2 and SAT 3 of foot-and-mouth disease virus (FMDV). A total of 250, 142 and 134 goat sera originating res...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید