Sciweavers

79 search results - page 6 / 16
» Efficient breadth-first manipulation of binary decision diag...
Sort
View
AAAI
2006
14 years 11 months ago
Controlled Search over Compact State Representations, in Nondeterministic Planning Domains and Beyond
Two of the most efficient planners for planning in nondeterministic domains are MBP and ND-SHOP2. MBP achieves its efficiency by using Binary Decision Diagrams (BDDs) to represent...
Ugur Kuter, Dana S. Nau
GLVLSI
1996
IEEE
145views VLSI» more  GLVLSI 1996»
15 years 1 months ago
Boolean Function Representation Using Parallel-Access Diagrams
Inthispaperweintroduceanondeterministiccounterpart to Reduced, Ordered Binary Decision Diagrams for the representation and manipulation of logic functions. ROBDDs are conceptually...
Valeria Bertacco, Maurizio Damiani
TCAD
2008
116views more  TCAD 2008»
14 years 9 months ago
Scalable Synthesis and Clustering Techniques Using Decision Diagrams
BDDs have proven to be an efficient means to represent and manipulate Boolean formulae [1] and sets [2] due to their compactness and canonicality. In this work, we leverage the eff...
Andrew C. Ling, Jianwen Zhu, Stephen Dean Brown
DATE
2006
IEEE
133views Hardware» more  DATE 2006»
15 years 3 months ago
Analysis and synthesis of quantum circuits by using quantum decision diagrams
Quantum information processing technology is in its pioneering stage and no proficient method for synthesizing quantum circuits has been introduced so far. This paper introduces a...
Afshin Abdollahi, Massoud Pedram
WER
2010
Springer
14 years 7 months ago
A Tool for Formal Feature Modeling Based on BDDs and Product Families Algebra
Feature models are commonly used to capture the commonality and the variability of product families. There are several feature model notations that correspondingly depict the conce...
Fadil Alturki, Ridha Khedri