2944 search results - page 7 / 589 » Improving Bound Propagation |
CPAIOR
2008
Springer
13 years 9 months ago
2008
Springer
We consider the problem of estimating the model count (number of solutions) of Boolean formulas, and present two techniques that compute estimates of these counts, as well as eith...
UAI
2004
13 years 8 months ago
2004
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
DATE
2005
IEEE
14 years 1 months ago
2005
IEEE
1 The first path implicit and exact non–robust path delay fault grading technique for non–scan sequential circuits is presented. Non enumerative exact coverage is obtained, b...
NIPS
2008
13 years 9 months ago
2008
A series of corrections is developed for the fixed points of Expectation Propagation (EP), which is one of the most popular methods for approximate probabilistic inference. These ...
ICTAI
2005
IEEE
14 years 1 months ago
2005
IEEE
Lotos is the ISO formal specification language for describing and verifying concurrent and distributed systems. The simulation or execution of complex Lotos specifications is, h...