Sciweavers

251 search results - page 18 / 51
» Lattice-Valued Binary Decision Diagrams
Sort
View
ICCTA
2007
IEEE
13 years 11 months ago
What Graphs can be Efficiently Represented by BDDs?
We have carried out experimental research into implicit representation of large graphs using reduced ordered binary decision diagrams (OBDDs). We experimentally show that for grap...
Changxing Dong, Paul Molitor
CSR
2006
Springer
13 years 11 months ago
Extended Resolution Proofs for Conjoining BDDs
We present a method to convert the construction of binary decision diagrams (BDDs) into extended resolution proofs. Besides in proof checking, proofs are fundamental to many applic...
Carsten Sinz, Armin Biere
DEXA
2006
Springer
80views Database» more  DEXA 2006»
13 years 11 months ago
Scalable Automated Service Composition Using a Compact Directory Digest
The composition of services that are indexed in a large-scale service directory often involves many complex queries issued by the service composition algorithm to the directory. Th...
Walter Binder, Ion Constantinescu, Boi Faltings
CSREAESA
2004
13 years 8 months ago
Approaches for Monitoring Vectors on Microprocessor Buses
This paper introduces two new methods for observing and recording the vectors that have been asserted on a bus. The first is a software approach that uses a novel data structure s...
Hector Arteaga, Hussain Al-Asaad
AIPS
2003
13 years 8 months ago
Guided Symbolic Universal Planning
Symbolic universal planning based on the reduced Ordered Binary Decision Diagram (OBDD) has been shown to be an efficient approach for planning in non-deterministic domains. To d...
Rune M. Jensen, Manuela M. Veloso, Randal E. Bryan...