Sciweavers

554 search results - page 27 / 111
» Approximate Probabilistic Model Checking
Sort
View
CVPR
2005
IEEE
14 years 9 months ago
Combining Object and Feature Dynamics in Probabilistic Tracking
Objects can exhibit different dynamics at different scales, and this is often exploited by visual tracking algorithms. A local dynamic model is typically used to extract image fea...
Leonid Taycher, John W. Fisher III, Trevor Darrell
CAV
2006
Springer
165views Hardware» more  CAV 2006»
13 years 11 months ago
Bounded Model Checking of Concurrent Data Types on Relaxed Memory Models: A Case Study
Many multithreaded programs employ concurrent data types to safely share data among threads. However, highly-concurrent algorithms for even seemingly simple data types are difficul...
Sebastian Burckhardt, Rajeev Alur, Milo M. K. Mart...
TACAS
2004
Springer
110views Algorithms» more  TACAS 2004»
14 years 1 months ago
An Interpolating Theorem Prover
We present a method of deriving Craig interpolants from proofs in the quantifier-free theory of linear inequality and uninterpreted function symbols, and an interpolating theorem...
Kenneth L. McMillan
TR
2010
126views Hardware» more  TR 2010»
13 years 2 months ago
Approximating a Loading-Dependent Cascading Failure Model With a Branching Process
Abstract--We quantify the closeness of the approximation between two high-level probabilistic models of cascading failure. In one model called CASCADE, failing components successiv...
Janghoon Kim, Ian Dobson
AIPS
2007
13 years 10 months ago
Approximate Solution Techniques for Factored First-Order MDPs
Most traditional approaches to probabilistic planning in relationally specified MDPs rely on grounding the problem w.r.t. specific domain instantiations, thereby incurring a com...
Scott Sanner, Craig Boutilier