Results 11 to 20 of about 5,149 (81)

Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bitsv [PDF]

, 2000
In this paper we consider four different definitions for an extension of a partially defined Boolean function in which the input contains some missing bits. We show that, for many general and reasonable families of function classes, three of these extensions are mathematically equivalent.
Endre Boros, Toshihide Ibaraki, Kazuhisa Makino   +2 more
openaire   +1 more source

RELATIONAL THEORY APPLICATION FOR OPTIMAL DESIGN OF INTEGRATED CIRCUITS [PDF]

Научно-технический вестник информационных технологий, механики и оптики, 2014
This paper deals with a method of relational theory adaptation for integrated circuits CAD systems. A new algorithm is worked out for optimal search of implicit Don’t Care values for combinational multiple-level digital circuits.
D. V. Demidov
doaj  

Evaluating Elicit’s systematic reviews workflow in an umbrella review on air pollution and acute lower respiratory infections: a methodological study for quality appraisal

BMC Medical Research Methodology
Background The exponential growth of scientific publications has increased the complexity of evidence synthesis. Systematic reviews remain essential but highly resource-intensive.
Cristina Mazzali, Tiziana Pinciroli, Maria Rosa Valetto, Pietro Dri, Antonio Giampiero Russo, Air and Health Atlas Study Group   +5 more
doaj   +1 more source

Finding the Subsets of Variables of a Partial Boolean Function Which Are Sufficient for Its Implementation in the Classes Defined by Predicates

Journal of Applied and Industrial Mathematics, 2020
Summary: Given a class \(K\) of partial Boolean functions and a partial Boolean function \(f\) of \(n\) variables, a subset \(U\) of its variables is called \textit{sufficient for the implementation of} \(f\) in \(K\) if there exists an extension of \(f\) in \(K\) with arguments in \(U\).
openaire   +3 more sources

Interplay Between Vertical and Horizontal Schemes of Computation: From Bayesian Inference to Quantum Logic via Gluing Boolean Algebras. [PDF]

Entropy (Basel)
Gunji YP, Nakamura K, Sasai K, Tani I, Kuroki M, Chiolerio A, Adamatzky A, Khrennikov A.   +7 more
europepmc   +1 more source

A Dataset of Benchmark Boolean Models for Gene Regulatory Networks. [PDF]

Sci Data
Hotstegs CLO, Llano JP, Kestler HA.
europepmc   +1 more source

Sketchbook: logical model inference from Boolean network sketches. [PDF]

Bioinform Adv
Huvar O, Beneš N, Brim L, Pastva S, Šafránek D.   +4 more
europepmc   +1 more source

Unveiling toxicological adverse outcomes: toward construction and simulation of large-scale networks. [PDF]

Toxicol Sci
Ikonomi N, Ketter N, Pepe MAA.
europepmc   +1 more source

Boolean logic links chromatin accessibility states to gene expression variability across cell types. [PDF]

Nucleic Acids Res
Malekpour SA, Jafari M, Sadeghi M.
europepmc   +1 more source

The SLO Hierarchy of Pseudo-Boolean Functions and Runtime of Evolutionary Algorithms. [PDF]

Algorithmica
Dang DC, Lehre PK.
europepmc   +1 more source