Sciweavers

4007 search results - page 80 / 802
» Computation with imprecise probabilities
Sort
View
IFM
2010
Springer
152views Formal Methods» more  IFM 2010»
13 years 8 months ago
Satisfaction Meets Expectations - Computing Expected Values of Probabilistic Hybrid Systems with SMT
Stochastic satisfiability modulo theories (SSMT), which is an extension of satisfiability modulo theories with randomized quantification, has successfully been used as a symboli...
Martin Fränzle, Tino Teige, Andreas Eggers
ICCAD
2006
IEEE
183views Hardware» more  ICCAD 2006»
14 years 7 months ago
Soft error derating computation in sequential circuits
Soft error tolerant design becomes more crucial due to exponential increase in the vulnerability of computer systems to soft errors. Accurate estimation of soft error rate (SER), ...
Hossein Asadi, Mehdi Baradaran Tahoori
JCSS
2006
63views more  JCSS 2006»
13 years 10 months ago
Error-bounded probabilistic computations between MA and AM
We introduce the probabilistic class SBP which is defined in a BPP-like manner. This class emerges from BPP by keeping the promise of a probability gap but decreasing the probabil...
Elmar Böhler, Christian Glaßer, Daniel ...
IPMU
2010
Springer
14 years 2 months ago
Independent Natural Extension
We introduce a general definition for the independence of a number of finite-valued variables, based on coherent lower previsions. Our definition has an epistemic flavour: it a...
Gert de Cooman, Enrique Miranda, Marco Zaffalon
WWW
2008
ACM
14 years 10 months ago
Computing minimum cost diagnoses to repair populated DL-based ontologies
Ontology population is prone to cause inconsistency because the populating process is imprecise or the populated data may conflict with the original data. By assuming that the int...
Jianfeng Du, Yi-Dong Shen