Sciweavers

Share
17 search results - page 1 / 4
» Mini-Buckets: A General Scheme for Generating Approximations...
Sort
View
IJCAI
1997
8 years 5 months ago
Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
Rina Dechter
AAAI
2010
8 years 5 months ago
New Mini-Bucket Partitioning Heuristics for Bounding the Probability of Evidence
Mini-Bucket Elimination (MBE) is a well-known approximation algorithm deriving lower and upper bounds on quantities of interest over graphical models. It relies on a procedure tha...
Emma Rollon, Rina Dechter
CSSC
2016
3 years 23 days ago
Non-parametric Sampling Approximation via Voronoi Tessellations
In this paper we propose a novel non-parametric sampling approach to estimate posterior distributions from parameters of interest. This technique is particularly suited for models...
Alejandro Villagran, Gabriel Huerta, Marina Vannuc...
NFM
2011
303views Formal Methods» more  NFM 2011»
7 years 11 months ago
Instantiation-Based Invariant Discovery
Abstract. We present a general scheme for automated instantiation-based invariant discovery. Given a transition system, the scheme produces k-inductive invariants from templates re...
Temesghen Kahsai, Yeting Ge, Cesare Tinelli
CADE
2008
Springer
9 years 4 months ago
Automated Induction with Constrained Tree Automata
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
Adel Bouhoula, Florent Jacquemard
books