112 search results - page 9 / 23 » Ordered Binary Decision Diagrams and the Davis-Putnam Proced... |
COCOON
2006
Springer
15 years 1 months ago
2006
Springer
We present an efficient reduction mapping undirected graphs G with n = 2k vertices for integers k to tables of partially specified Boolean functions g : {0, 1}4k+1 {0, 1, } so tha...
MICAI
2007
Springer
15 years 3 months ago
2007
Springer
Previous work on context-specific independence in Bayesian networks is driven by a common goal, namely to represent the conditional probability tables in a most compact way. In th...
DEXA
2006
Springer
15 years 1 months ago
2006
Springer
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...
66
Voted
AIPS
2003
14 years 11 months ago
2003
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...
ICCD
2001
IEEE
15 years 6 months ago
2001
IEEE
Reduced Ordered Binary Decision Diagrams (BDDs) are a data structure for representation and manipulation of Boolean functions which are frequently used in VLSI Design Automation. ...