Sciweavers

395 search results - page 4 / 79
» Polynomial Approximations for Model Checking
Sort
View
DATE
2003
IEEE
100views Hardware» more  DATE 2003»
15 years 3 months ago
Improving SAT-Based Bounded Model Checking by Means of BDD-Based Approximate Traversals
: Binary Decision Diagrams (BDDs) have been widely used in synthesis and verification. Boolean Satisfiability (SAT) Solvers, on the other hand, have been gaining
Gianpiero Cabodi, Sergio Nocco, Stefano Quer
ENTCS
2006
122views more  ENTCS 2006»
14 years 10 months ago
Algorithmic Algebraic Model Checking III: Approximate Methods
Venkatesh Mysore, Bud Mishra
WIA
2009
Springer
15 years 4 months ago
TAGED Approximations for Temporal Properties Model-Checking
Roméo Courbis, Pierre-Cyrille Héam, ...
ICML
2002
IEEE
15 years 10 months ago
Univariate Polynomial Inference by Monte Carlo Message Length Approximation
We apply the Message from Monte Carlo (MMC) algorithm to inference of univariate polynomials. MMC is an algorithm for point estimation from a Bayesian posterior sample. It partiti...
Leigh J. Fitzgibbon, David L. Dowe, Lloyd Allison
CORR
2011
Springer
176views Education» more  CORR 2011»
14 years 4 months ago
Inner approximations for polynomial matrix inequalities and robust stability regions
Following a polynomial approach, many robust fixed-order controller design problems can be formulated as optimization problems whose set of feasible solutions is modelled by para...
Didier Henrion, Jean B. Lasserre