Results 211 to 220 of about 2,176 (251)

An efficient exact learning algorithm for ordered binary decision diagrams [PDF]

, 1997
In this paper, we propose a new algorithm which exactly learns ordered binary decision diagrams (OBDDs) with a given variable ordering via equivalence queries and membership queries. Our algorithm uses at most n equivalence queries and at most 2n([log2m] + 3n) membership queries, where n is the number of nodes in the target reduced OBDD and m is the ...
Nakamura, Atsuyoshi
openaire   +2 more sources

Secure function evaluation with ordered binary decision diagrams [PDF]

Proceedings of the 13th ACM conference on Computer and communications security, 2006
Privacy-preserving protocols allow multiple parties with private inputs to perform joint computation while preserving the privacy of their respective inputs. An important cryptographic primitive for designing privacy-preserving protocols is secure function evaluation (SFE).
Louis Kruger, Somesh Jha, Eu-Jin Goh, Dan Boneh   +3 more
openaire   +2 more sources

Terminological Reasoning in SHIQ with Ordered Binary Decision Diagrams. [PDF]

, 2008
We present a new algorithm for reasoning in the description logic SHIQ, which is the most prominent fragment of the Web Ontology Language OWL. The algorithm is based on ordered binary decision diagrams (OBDDs) as a datastructure for storing and operating on large model representations.
Sebastian Rudolph, Markus Krötzsch, Pascal Hitzler   +2 more
openaire   +4 more sources

Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance [PDF]

Information Processing Letters, 2006
Ordered binary decision diagrams with repeated tests are considered both in complexity theory and in applications. Bollig et al. have proved in [B. Bollig, M. Sauerhoff, D. Sieling, I. Wegener, Hierarchy theorems of kOBDDs and kIBDDs, Theoret.
Stephan Waack
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

On Aligning Non-Order-Associated Binary Decision Diagrams

INFORMS Journal on Computing, 2023
Recent studies employ collections of binary decision diagrams (BDDs) to solve combinatorial optimization problems. This paper focuses on the problem of optimally aligning two BDDs, that is, transforming them to enforce a common order of variables while keeping the total size of the diagrams as small as possible. We address this problem, which is known
Alexey A. Bochkarev, J. Cole Smith
openaire   +1 more source

Evolutionary-Reduced Ordered Binary Decision Diagram

2009 Third Asia International Conference on Modelling & Simulation, 2009
Reduced ordered binary decision diagram (ROBDD) is a memory-efficient data structure which is used in many applications such as synthesis, digital system, verification, testing and VLSI-CAD. The size of an ROBDD for a function can be increased exponentially by the number of independent variables of the function that is called “memory explosion problem”.
Hossein Moeinzadeh, Mehdi Mohammadi, Hossein Pazhoumand-dar, Arman Mehrbakhsh, Navid Kheibar, Nasser Mozayani   +5 more
openaire   +1 more source

Variable ordering for binary decision diagrams

[1992] Proceedings The European Conference on Design Automation, 2003
Considers the problem of variable ordering in binary decision diagrams (BDD's). The authors present several heuristics for finding a good variable ordering based on the algebraic structure of the functions. They provide a non-interleaving theorem and an accurate cost formula for the optimal ordering.
S.-W. Jeong, B. Plessier, G.D. Hachtel, F. Somenzi   +3 more
openaire   +1 more source

Ordered Binary Decision Diagrams

1992
In order to facilitate a detailed study of the perturbations of various fault models on the normal functioning of a given circuit, it is helpful to have the capacity to find all the tests for each fault in a fault set. One procedure to gather this information would be to inject each fault in the fault set, one at a time, and simulate all possible input
Kenneth M. Butler, M. Ray Mercer
openaire   +1 more source

Ordered binary decision diagrams and circuit structure

Proceedings 1989 IEEE International Conference on Computer Design: VLSI in Computers and Processors, 2003
The relationship between two important means of representing Boolean functions, combinational circuits and ordered binary decision diagrams (OBDDs), is studied. Circuit width is related to OBDD size, and it is shown how register allocation can be used to determine a good variable order of OBDD construction. It is shown that if C has n inputs, m outputs,
openaire   +1 more source

OBDDs — Ordered Binary Decision Diagrams

1998
In this chapter, we introduce the representation type of ordered binary decision diagrams, called OBDDs for short. Although the underlying model of decision diagrams (or synonymously branching programs) was already studied by Lee and Akers in the 1950s and 1970s, these representations have not been used in serious applications for a long time. In 1986,
Christoph Meinel, Thorsten Theobald
openaire   +1 more source