Sciweavers

112 search results - page 6 / 23
» Ordered Binary Decision Diagrams and the Davis-Putnam Proced...
Sort
View
ICCAD
1994
IEEE
109views Hardware» more  ICCAD 1994»
14 years 13 hour ago
Efficient breadth-first manipulation of binary decision diagrams
We propose new techniques for efficient breadth-first iterative manipulation of ROBDDs. Breadth-first iterative ROBDD manipulation can potentially reduce the total elapsed time by...
Pranav Ashar, Matthew Cheong
TCAD
1998
161views more  TCAD 1998»
13 years 7 months ago
Ordered Kronecker functional decision diagrams-a data structure for representation and manipulation of Boolean functions
— Ordered Kronecker functional decision diagrams (OKFDD’s) are a data structure for efficient representation and manipulation of Boolean functions. OKFDD’s are a generalizat...
Rolf Drechsler, Bernd Becker
AAAI
2008
13 years 10 months ago
Limits and Possibilities of BDDs in State Space Search
This paper investigates the impact of symbolic search for solving domain-independent action planning problems with binary decision diagrams (BDDs). Polynomial upper and exponential...
Stefan Edelkamp, Peter Kissmann
CP
2006
Springer
13 years 11 months ago
Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs)
Abstract. Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Ordered Decision Diagrams with AND nodes, in order to capture function de...
Robert Mateescu, Rina Dechter
ISMVL
2000
IEEE
98views Hardware» more  ISMVL 2000»
14 years 8 days ago
Implementation of Multiple-Output Functions Using PQMDDs
A sequential realization of multiple-output logic functions is presented. A conventional sequential realization is based on SBDDs (Shared reduced ordered Binary Decision Diagrams)...
Yukihiro Iguchi, Tsutomu Sasao, Munehiro Matsuura