Results 21 to 30 of about 3,612,733 (245)

A Kamm’s Circle-Based Potential Risk Estimation Scheme in the Local Dynamic Map Computation Enhanced by Binary Decision Diagrams

open access: yesSensors, 2022
Autonomous vehicles (AV) are a hot topic for safe mobility, which inevitably requires sensors to achieve autonomy, but relying too heavily on sensors will be a risk factor.
Arvind Kumar, Hiroaki Wagatsuma
doaj   +1 more source

Binary decision diagrams on modern hardware

open access: yesProceedings of the 23rd Conference on Formal Methods in Computer-Aided Design, 2023
Binary decision diagrams (BDDs) are one of the fundamental data structures in formal methods and computer science in general. However, the performance of BDD-based algorithms greatly depends on memory latency due to the reliance on large hash tables and thus, by extension, on the speed of random memory access.
Samuel Pastva, Thomas A. Henzinger
openaire   +1 more source

Influence of Load on Reliability of Storage Area Networks [PDF]

open access: yesInternational Journal of Mathematical, Engineering and Management Sciences, 2021
During the coronavirus pandemic, telecommuting is widely required, making remote data access grow significantly. This requires highly reliable data storage solutions. Storage area networks (SANs) are one of such solutions.
Guixiang Lv, Liudong Xing
doaj   +1 more source

Efficient Set Sharing Using ZBDDs [PDF]

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   +1 more source

Compression with wildcards: All exact or all minimal hitting sets

open access: yesOpen Mathematics, 2023
Our objective is the compressed enumeration (based on wildcards) of all minimal hitting sets of general hypergraphs. To the author’s best knowledge, the only previous attempt towards compression, due to Toda, is based on binary decision diagrams and much
Wild Marcel
doaj   +1 more source

Approximate BDD Minimization by Weighted A* [PDF]

open access: yes, 2008
Reduced ordered Binary Decision Diagrams (BDDs) are a data structure for efficient representation and manipulation of Boolean functions. They are frequently used in logic synthesis. The size of BDDs depends on a chosen variable ordering, i.e.
Rudiger Ebendt   +3 more
core   +2 more sources

Application of decision diagrams of incompletely specified of k-valued logic functions in the synthesis of logical circuits

open access: yesInformatika, 2023
Objectives. The problem of circuit implementation of incompletely specified (partial) k-valued logic functions given by tabular representations is considered.
P. N. Bibilo
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

Binary decision diagram‐based synthesis technique for improved mapping of Boolean functions inside memristive crossbar‐slices

open access: yesIET Computers & Digital Techniques, 2021
Memristors are two‐terminal nano‐electronic devices that make it possible to design non‐volatile memory and logic circuits with high integration density.
Anindita Chakraborty   +5 more
doaj   +1 more source

Novel Reduction Methods for Decision Diagrams

open access: yesIEEE Access, 2023
We propose a novel method of reduction for binary-based decision diagrams (DD) exploiting the similarities between Boolean functions. Conventional methods are able to remove redundant parts of DD that adhere to (or represent) identical structures.
Jan Lucansky, Ivan Kotuliak
doaj   +1 more source

Home - About - Disclaimer - Privacy