Sciweavers

854 search results - page 151 / 171
» Abstracting from Failure Probabilities
Sort
View
POPL
2007
ACM
16 years 3 days ago
Program verification as probabilistic inference
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...
Sumit Gulwani, Nebojsa Jojic
ECCV
2004
Springer
16 years 1 months ago
An MCMC-Based Particle Filter for Tracking Multiple Interacting Targets
Abstract. We describe a Markov chain Monte Carlo based particle filter that effectively deals with interacting targets, i.e., targets that are influenced by the proximity and/or be...
Zia Khan, Tucker R. Balch, Frank Dellaert
ICSE
2007
IEEE-ACM
15 years 12 months ago
A Robust Semantic Overlay Network for Microgrid Control Applications
Abstract. Control systems for electrical microgrids rely ever more on heterogeneous off-the-shelf technology for hardware, software and networking among the intelligent electronic ...
Geert Deconinck, Koen Vanthournout, Hakem Beitolla...
PPOPP
2010
ACM
15 years 9 months ago
GAMBIT: effective unit testing for concurrency libraries
As concurrent programming becomes prevalent, software providers are investing in concurrency libraries to improve programmer productivity. Concurrency libraries improve productivi...
Katherine E. Coons, Sebastian Burckhardt, Madanlal...
APPROX
2007
Springer
104views Algorithms» more  APPROX 2007»
15 years 6 months ago
Worst-Case to Average-Case Reductions Revisited
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
Dan Gutfreund, Amnon Ta-Shma