Sciweavers

17 search results - page 4 / 4
» The computational complexity of graph contractions I: Polyno...
Sort
View
CORR
2011
Springer
172views Education» more  CORR 2011»
13 years 1 months ago
Improving Strategies via SMT Solving
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
Thomas Martin Gawlitza, David Monniaux
AI
2010
Springer
13 years 6 months ago
Understanding the scalability of Bayesian network inference using clique tree growth curves
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...
Ole J. Mengshoel