Results 31 to 40 of about 11,440 (300)

Minimization of binary decision diagrams for systems of completely defined Boolean functions using Shannon expansions and algebraic representations of cofactors

open access: yesInformatika, 2021
In the systems of digital VLSI design (Very Large Integrated Circuits), the BDD (Binary Decision Diagram) is used for VLSI verification, as well as for technologically independent optimization as the first stage in the synthesis of logic circuits in ...
P. N. Bibilo, V. I. Romanov
doaj   +1 more source

Masking of Internal Nodes Faults Based on Applying of Incompletely Specified Boolean Functions [PDF]

open access: yesИзвестия Саратовского университета. Новая серия: Математика. Механика. Информатика, 2020
Combinational circuits (combinational parts of sequential circuits) are considered. Masking of internal nodes faults with applying sub-circuit, inputs of which are connected to the circuit inputs and outputs — to the circuit proper internal nodes, is ...
Matrosova, Angela Yu.   +2 more
doaj   +1 more source

TeDDy: Templated decision diagram library

open access: yesSoftwareX
Discrete functions are an integral part of numerous areas of research in mathematics and computer science. Efficient processing of such functions in a computer requires an appropriate representation.
Michal Mrena   +2 more
doaj   +1 more source

Formal Methods for Exact Analysis of Approximate Circuits

open access: yesIEEE Access, 2019
Approximate circuits are digital circuits that are intentionally designed in such a way that the specification is violated in terms of functionality in order to obtain some improvements in power consumption, performance or area, in comparison with fully ...
Zdenek Vasicek
doaj   +1 more source

Optimizing Binary Decision Diagrams with MaxSAT for Classification

open access: yesProceedings of the AAAI Conference on Artificial Intelligence, 2022
The growing interest in explainable artificial intelligence(XAI) for critical decision making motivates the need for interpretable machine learning (ML) models. In fact, due to their structure (especially with small sizes), these models are inherently understandable by humans.
Hu, Hao   +2 more
openaire   +3 more sources

A Recursive Framework for Evaluating Moments Using Zero-Suppressed Binary Decision Diagrams

open access: yesIEEE Access
The zero-suppressed binary decision diagram (ZDD) is a compact data structure widely used for the efficient representation of families of sparse subsets.
Brian Godwin Lim   +4 more
doaj   +1 more source

Efficient Set Sharing Using ZBDDs

open access: yes, 2008
Set sharing is an abstract domain in which each concrete object is represented by the set of local variables from which it might be reachable. It is a useful abstraction to detect parallelism opportunities, since it contains definite information about ...
Mario Méndez-Lojo   +5 more
core   +2 more sources

Subtype‐specific enhancer RNAs define transcriptional regulators and prognosis in breast cancers

open access: yesMolecular Oncology, EarlyView.
This study employed machine learning methodologies to perform the subtype‐specific classification of RNA‐seq data sets, which are mapped on enhancers from TCGA‐derived breast cancer patients. Their integration with gene expression (referred to as ProxCReAM eRNAs) and chromatin accessibility profiles has the potential to identify lineage‐specific and ...
Aamena Y. Patel   +6 more
wiley   +1 more source

COMP–PMEPA1 axis promotes epithelial‐to‐mesenchymal transition in breast cancer cells

open access: yesMolecular Oncology, EarlyView.
This study reveals that cartilage oligomeric matrix protein (COMP) promotes epithelial‐to‐mesenchymal transition (EMT) in breast cancer. We identify PMEPA1 (protein TMEPAI) as a novel COMP‐binding partner that mediates EMT via binding to the TSP domains of COMP, establishing the COMP–PMEPA1 axis as a key EMT driver in breast cancer.
Konstantinos S. Papadakos   +6 more
wiley   +1 more source

Lex-Partitioning: A New Option for BDD Search [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2012
For the exploration of large state spaces, symbolic search using binary decision diagrams (BDDs) can save huge amounts of memory and computation time. State sets are represented and modified by accessing and manipulating their characteristic functions ...
Stefan Edelkamp   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy