Results 61 to 70 of about 5,145 (79)
Role of frustrations in cell reprogramming. [PDF]
Yao Y, Zhu J, Li W, Pei D.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Horn Extensions of a Partially Defined Boolean Function
SIAM Journal on Computing, 1999Summary: Given a partially defined Boolean function (pdBf) \((T,F)\), we investigate in this paper how to find a Horn extension \(f: \{0,1\}^n \mapsto \{0,1\}\), which is consistent with \((T,F)\), where \(T \subseteq \{0,1\}^n\) denotes a set of true Boolean vectors (or positive examples) and \(F \subseteq \{0,1\}^n\) denotes a set of false Boolean ...
Kazuhisa Makino
exaly +2 more sources
IEEE Transactions on Knowledge and Data Engineering, 2011
The problem of reconstructing the AND-OR expression of a partially defined positive Boolean function (pdpBf) is solved by adopting a novel algorithm, denoted by LSC, which combines the advantages of two efficient techniques, Logical Analysis of Data (LAD) and Shadow Clustering (SC). The kernel of the approach followed by LAD consists in a breadth-first
Enrico Ferrari, Marco Muselli
exaly +3 more sources
The problem of reconstructing the AND-OR expression of a partially defined positive Boolean function (pdpBf) is solved by adopting a novel algorithm, denoted by LSC, which combines the advantages of two efficient techniques, Logical Analysis of Data (LAD) and Shadow Clustering (SC). The kernel of the approach followed by LAD consists in a breadth-first
Enrico Ferrari, Marco Muselli
exaly +3 more sources
Partially Defined Boolean Functions in TRIZ
IFIP Advances in Information and Communication Technology, 2023Jerzy Chrzaszcz, Chrzaszcz Jerzy
exaly +2 more sources
Reduced disjunctive normal forms of partially defined boolean functions
Cybernetics and Systems Analysis, 1969exaly +2 more sources
A method for minimizing partially defined Boolean functions
Acta Cybern., 1979Ferenc Móricz +2 more
openaire +2 more sources
International Journal of Information Technology
Rajneesh Kumar Pandey, Tanmoy Kanti Das
openaire +1 more source
Rajneesh Kumar Pandey, Tanmoy Kanti Das
openaire +1 more source
Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bitsv
Lecture Notes in Computer Science, 2001Endre Boros +2 more
exaly

