200 search results - page 3 / 40 » What Graphs can be Efficiently Represented by BDDs |
ICCAD
1996
IEEE
13 years 11 months ago
1996
IEEE
This paper describes an algorithm for the efficient solution of large systems of Boolean equations. The algorithm exploits the fact that, in some cases, the composition operation ...
TCAD
2002
13 years 7 months ago
2002
Many tasks in CAD, such as equivalence checking, property checking, logic synthesis, and false paths analysis require efficient Boolean reasoning for problems derived from circuits...
ICDE
2003
IEEE
14 years 8 months ago
2003
IEEE
A Web repository is a large special-purpose collection of Web pages and associated indexes. Many useful queries and computations over such repositories involve traversal and navig...
AAAI
2006
13 years 8 months ago
2006
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...
SEMWEB
2005
Springer
14 years 28 days ago
2005
Springer
Probabilistic inference will be of special importance when one needs to know how much we can say with what all we know given new observations. Bayesian Network is a graphical prob...