Zobrazeno 1 - 10
of 647
pro vyhledávání: '"Implicant"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
International Journal of Applied Mathematics and Computer Science, Vol 30, Iss 1, Pp 161-171 (2020)
The biclustering of two-dimensional homogeneous data consists in finding a subset of rows and a subset of columns whose intersection provides a set of cells whose values fulfil a specified condition. Usually it is defined as equality or comparability
Externí odkaz:
https://doaj.org/article/30450e73de244e42b29e5ec5f7363e7f
Publikováno v:
Journal of Engineering Research and Reports. :117-137
This paper utilizes a modern regular and modular eight-variable Karnaugh map in a systematic investigation of cause-effect relationships modeled by partially-defined Boolean functions (PDBF) (known also as incompletely specified switching functions).
Publikováno v:
Asian Journal of Education and Social Studies. :26-42
We use a regular and modular eight-variable Karnaugh map to reveal some technical details of Boolean minimization usually employed in solving problems of Qualitative Comparative Analysis (QCA). We utilize as a large running example a prominent eight-
Publikováno v:
Asian Journal of Research in Computer Science. :57-84
Qualitative Comparative Analysis (QCA) is an emergent methodology of diverse applications in many disciplines. However, its premises and techniques are continuously subject to discussion, debate, and (even) dispute. We use a regular and modular Karna
Autor:
Fatih Başçiftçi, Hakan Akar
Publikováno v:
Ain Shams Engineering Journal, Vol 12, Iss 1, Pp 729-737 (2021)
Previously finding prime implicants based on off-cubes was explored as an approach to minimize insignificant logic functions which include minterms both easy and difficult to cover. Off-cube based function minimization falls short in certain function
Autor:
I. P. Chukhrov
Publikováno v:
Journal of Applied and Industrial Mathematics. 15:17-38
The well-known lower bound for the maximum number of prime implicants of a Boolean function (the length of the reduced DNF) differs by $$\Theta (\sqrt {n}) $$ times from the upper bound and is asymptotically attained at a symmetric belt function with
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Journal of Engineering Research and Reports. :12-29
Checking a symbolic reliability expression for a flow network is useful for detecting faults in hand derivations and for debugging computer programs. This checking can be achieved in a systematic way, though it may be a formidable task. Three exhaust
Autor:
Wäldchen, Stephan
In this thesis we develop a framework for interpreting the decisions of highly nonlinear classifier functions with a focus on neural networks. Specifically, we formalise the idea of separating the input parameters into relevant and irrelevant ones as
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f3988fff362f373cc7363d776b0b5d34
https://depositonce.tu-berlin.de/handle/11303/17230
https://depositonce.tu-berlin.de/handle/11303/17230