Results 281 to 290 of about 65,002 (306)
Some of the next articles are maybe not open access.

A Heterogeneous Decision Diagram Package

2009
This paper describes a decision diagram package for efficient computation with large matrices. The heterogeneous decision diagrams supported by the package do not require the selection variables to have a single domain. Computations can be over a selected field up to the complex numbers including finite fields. Implementation strategies supporting this
D. Michael Miller, Radomir S. Stankovic
openaire   +1 more source

Sequence Sentential Decision Diagrams

2018
In this paper, we propose a new data structure sequence sentential decision diagram (SSDD) that represents sets of strings. SSDD is a generalized data structure of Sequence Binary Decision Diagram (SeqBDD), that is a similar data structure to a deterministic finite automaton, but the size can be exponentially smaller than the SeqBDD for the same string
openaire   +1 more source

Decision Diagrams

2023
Stefan Hillmich, Robert Wille
openaire   +1 more source

Decision Diagrams for Discrete Optimization: A Survey of Recent Advances

INFORMS Journal on Computing, 2022
Margarita P Castro   +2 more
exaly  

Decision Diagrams and Dynamic Programming

2013
Binary and multivalued decision diagrams are closely related to dynamic programming (DP) but differ in some important ways. This paper makes the relationship more precise by interpreting the DP state transition graph as a weighted decision diagram and incorporating the state-dependent costs of DP into the theory of decision diagrams.
openaire   +1 more source

Decision Trees and Diagrams

ACM Computing Surveys, 1982
openaire   +1 more source

A∗-based construction of decision diagrams for a prize-collecting scheduling problem

Computers and Operations Research, 2021
Matthias Horn   +2 more
exaly  

Synthesis for Testability: Binary Decision Diagrams

1992
We investigate the testability properties of Boolean circuits derived from (Reduced Ordered) Binary Decision Diagrams. It is shown that BDD-cirucits (or at least) BDD-like circuits are easily testable with respect to different fault models (cellular, stuck-at and path delay fault model).
openaire   +1 more source

Symbolic Boolean manipulation with ordered binary-decision diagrams

ACM Computing Surveys, 1992
Randal E Bryant
exaly  

Home - About - Disclaimer - Privacy