Results 221 to 230 of about 138,192 (261)

Epidemiology of Brucellosis Among Deer in China From 1978 to 2025: A Systematic Review and Meta-Analysis. [PDF]

Transbound Emerg Dis
Xiang WT, Yu JY, Jiang QC, Zhang YF, Liang R, Li T, Zheng W, Li JM, Liu F, Du R.   +9 more
europepmc   +1 more source

Serological investigation of foot and mouth disease in cattle in East Bale Zone, Ethiopia. [PDF]

BMC Vet Res
Geleto FT, Dilba GM, Muluneh A, Benti T, Dinbiso TD.   +4 more
europepmc   +1 more source

Artificial test-takers as transformed controls: measuring SAT difficulty drift and student performance. [PDF]

Front Artif Intell
Suresh VK, Rawat S.
europepmc   +1 more source

Lessons from single cell omics: admixed American ancestry and sex confer cardiometabolic disease risk in Mexicans. [PDF]

Genome Med
Kar A, Lee SHT, Alvarez M, Rajkumar S, Das SS, Ochoa-Guzmán A, Muñoz-Hernandez LL, Guillen-Quintero DM, Herrera-Hernandez M, Cruz-Bautista I, Heinonen S, Saarinen T, Juuti A, Laakso M, Pietiläinen KH, Balliu B, Aguilar-Salinas C, Tusié-Luna MT, Pajukanta P.   +18 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

SAT-to-SAT: Declarative Extension of SAT Solvers with New Propagators

Proceedings of the AAAI Conference on Artificial Intelligence, 2016
Special-purpose propagators speed up solving logic programs by inferring facts that are hard to deduce otherwise. However, implementing special-purpose propagators is a non-trivial task and requires expert knowledge of solvers. This paper proposes a novel approach in logic programming that allows (1) logical specification of both the ...
Tomi Janhunen, Shahab Tasharrofi, Eugenia Ternovska   +2 more
openaire   +4 more sources

CUD@SAT: SAT solving on GPUs

Journal of Experimental & Theoretical Artificial Intelligence, 2014
The parallel computing power offered by graphic processing units (GPUs) has been recently exploited to support general purpose applications – by exploiting the availability of general API and the single-instruction multiple-thread-style parallelism present in several classes of problems (e.g.
Alessandro Dal Palù, Agostino Dovier, Andrea Formisano 0001, Enrico Pontelli   +3 more
openaire   +4 more sources

SATConda: SAT to SAT-Hard Clause Translator

2020 21st International Symposium on Quality Electronic Design (ISQED), 2020
Logic obfuscation emerged as an efficient solution to strengthen the security of integrated circuits (ICs) from multiple threats including reverse engineering and intellectual property (IP) theft. Emergence of Boolean Satisfiability (SAT) attacks and its variants have shown to circumvent the security mechanisms such as obfuscation and a plethora of its
Rakibul Hassan, Gaurav Kolhe, Setareh Rafatirad, Houman Homayoun, Sai Manoj Pudukotai Dinakarrao   +4 more
openaire   +3 more sources

On the complexity of SAT

40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039), 2003
We show that non-deterministic time NTIME(n) is not contained in deterministic time n/sup 2-/spl epsiv// and polylogarithmic space, for any /spl epsiv/>0. This implies that (infinitely often), satisfiability cannot be solved in time O(n/sup 2-/spl epsiv//) and polylogarithmic space.
Richard J. Lipton, Anastasios Viglas
openaire   +1 more source