Results 41 to 50 of about 3,622,400 (195)
Formal Methods for Exact Analysis of Approximate Circuits
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
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
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
TeDDy: Templated decision diagram library
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
Optimal Maintenance Management of Offshore Wind Farms
Nowadays offshore wind energy is the renewable energy source with the highest growth. Offshore wind farms are composed of large and complex wind turbines, requiring a high level of reliability, availability, maintainability and safety (RAMS).
Alberto Pliego Marugán +2 more
doaj +1 more source
Optimizing Binary Decision Diagrams with MaxSAT for Classification
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.
Hao Hu 0008 +2 more
openaire +3 more sources
SAT-Based Learning of Compact Binary Decision Diagrams for Classification [PDF]
Decision trees are a popular classification model in machine learning due to their interpretability and performance. However, the number of splits in decision trees grow exponentially with their depth which can incur a higher computational cost, increase
Shati, Pouya +2 more
core +1 more source
A Recursive Framework for Evaluating Moments Using Zero-Suppressed Binary Decision Diagrams
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
Lattice-Valued Binary Decision Diagrams [PDF]
This work introduces a new data structure, called Lattice-Valued Binary Decision Diagrams (or LVBDD for short), for the compact representation and manipulation of functions of the form θ : 2P → L, where P is a finite set of Boolean propositions and L is a finite distributive lattice.
Geeraerts, Gilles +4 more
openaire +3 more sources
Extended resolution simulates binary decision diagrams [PDF]
We prove that binary decision diagrams [R. Bryant, Symbolic Boolean manipulation with ordered binary decision diagrams, ACM Comput. Surveys 23 (3) (1992)] can be polynomially simulated by the extended resolution rule of [G.S.
Nicolas Peltier, Peltier, Nicolas
core +1 more source

