Results 231 to 240 of about 357,721 (279)
Some of the next articles are maybe not open access.
2020
An effective way to represent logic functions is the Binary Decision Diagram (BDD). The prototype of the BDD was the Binary Decision Programs (BDP), in which different nodes in a given path can be assigned the same variable.
Marcin Kubica, Adam Opara, Dariusz Kania
openaire +1 more source
An effective way to represent logic functions is the Binary Decision Diagram (BDD). The prototype of the BDD was the Binary Decision Programs (BDP), in which different nodes in a given path can be assigned the same variable.
Marcin Kubica, Adam Opara, Dariusz Kania
openaire +1 more source
Linear sifting of decision diagrams
Proceedings of the 34th annual conference on Design automation conference - DAC '97, 1997We propose a new algorithm, called linear sifting, for theoptimization of decision diagrams that combines the efficiency of sifting and the power of linear transformations. We show that the new algorithm is applicable to large examples, and that inmany cases it leads to substantiallymore compact diagrams when compared to simple variablereordering.
C. Meinel, F. Somenzi, T. Theobald
openaire +1 more source
2011
A binary decision diagram is a directed acyclic graph that consists of nodes and edges. It deals with Boolean functions. A binary decision diagram consists of a set of decision nodes, starting at the root node at the top of the decision diagram. Each decision node contains two outgoing branches, one is a high branch and the other is a low branch. These
openaire +1 more source
A binary decision diagram is a directed acyclic graph that consists of nodes and edges. It deals with Boolean functions. A binary decision diagram consists of a set of decision nodes, starting at the root node at the top of the decision diagram. Each decision node contains two outgoing branches, one is a high branch and the other is a low branch. These
openaire +1 more source
2014
Compact encoding of finite sets of strings is a classic problem. The manipulation of large sets requires compact data structures that allow for efficient set operations. We define sequence decision diagrams (SeqDDs), which can encode arbitrary finite sets of strings over an alphabet.
Hind Alhakami +2 more
openaire +1 more source
Compact encoding of finite sets of strings is a classic problem. The manipulation of large sets requires compact data structures that allow for efficient set operations. We define sequence decision diagrams (SeqDDs), which can encode arbitrary finite sets of strings over an alphabet.
Hind Alhakami +2 more
openaire +1 more source
2016
This chapter presents a general-purpose methodology for obtaining a set of feasible solutions to a discrete optimization problems using restricted decision diagrams. A restricted diagram can be perceived as a counterpart of the concept of relaxed diagrams introduced in previous chapters, and represents an under approximation of the feasible set, the ...
David Bergman +3 more
openaire +1 more source
This chapter presents a general-purpose methodology for obtaining a set of feasible solutions to a discrete optimization problems using restricted decision diagrams. A restricted diagram can be perceived as a counterpart of the concept of relaxed diagrams introduced in previous chapters, and represents an under approximation of the feasible set, the ...
David Bergman +3 more
openaire +1 more source
2009 International Conference on Future Computer and Communication, 2009
the primary aim of computer science is invention of new data structures and algorithms. Those data structures and algorithms could significantly help us to solve unsolved problems or let us give much better solutions for the already solved problems. In this paper we introduce BDD (Binary Decision Diagram) and its variants OBDD (Ordered Binary Decision ...
Farnaz Towhidi +2 more
openaire +1 more source
the primary aim of computer science is invention of new data structures and algorithms. Those data structures and algorithms could significantly help us to solve unsolved problems or let us give much better solutions for the already solved problems. In this paper we introduce BDD (Binary Decision Diagram) and its variants OBDD (Ordered Binary Decision ...
Farnaz Towhidi +2 more
openaire +1 more source
Binary-decision-diagram device
IEEE Transactions on Electron Devices, 1995The device proposed here for future LSI's is based on a concept different from the Boolean equations usually used for representing digital functions. The unit function of this device is simple two-way switching and can be implemented utilizing various physical effects, such as optical switching, electron-wave modulation, and single-electron transport ...
N. Asahi, M. Akazawa, Y. Amemiya
openaire +1 more source
2016
In this chapter we introduce a modeling framework based on dynamic programming to compile exact decision diagrams. We describe how dynamic programming models can be used in a top-down compilation method to construct exact decision diagrams. We also present an alternative compilation method based on constraint separation.
David Bergman +3 more
openaire +1 more source
In this chapter we introduce a modeling framework based on dynamic programming to compile exact decision diagrams. We describe how dynamic programming models can be used in a top-down compilation method to construct exact decision diagrams. We also present an alternative compilation method based on constraint separation.
David Bergman +3 more
openaire +1 more source
2018
Binary decision diagrams provide a data structure for representing and manipulating Boolean functions in symbolic form. They have been especially effective as the algorithmic basis for symbolic model checkers. A binary decision diagram represents a Boolean function as a directed acyclic graph, corresponding to a compressed form of decision tree.
openaire +1 more source
Binary decision diagrams provide a data structure for representing and manipulating Boolean functions in symbolic form. They have been especially effective as the algorithmic basis for symbolic model checkers. A binary decision diagram represents a Boolean function as a directed acyclic graph, corresponding to a compressed form of decision tree.
openaire +1 more source