Sciweavers

554 search results - page 46 / 111
» Approximate Probabilistic Model Checking
Sort
View
CORR
2008
Springer
154views Education» more  CORR 2008»
13 years 7 months ago
A Counterexample Guided Abstraction-Refinement Framework for Markov Decision Processes
rexample Guided Abstraction-Refinement Framework for Markov Decision Processes ROHIT CHADHA and MAHESH VISWANATHAN Dept. of Computer Science, University of Illinois at Urbana-Champ...
Rohit Chadha, Mahesh Viswanathan
CORR
2009
Springer
242views Education» more  CORR 2009»
13 years 5 months ago
Adaptive Scheduling of Data Paths using Uppaal Tiga
Abstract. We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a p...
Israa AlAttili, Fred Houben, Georgeta Igna, Steffe...
SBMF
2009
Springer
126views Formal Methods» more  SBMF 2009»
14 years 6 days ago
Undecidability Results for Distributed Probabilistic Systems
Abstract. In the verification of concurrent systems involving probabilities, the aim is to find out the maximum/minimum probability that a given event occurs (examples of such ev...
Sergio Giro
ICIP
2003
IEEE
14 years 29 days ago
Texture analysis: an adaptive probabilistic approach
Two main issues arise when working in the area of texture segmentation: the need to describe the texture accurately by capturing its underlying structure, and the need to perform ...
Karen Brady, Ian Jermyn, Josiane Zerubia
ICDE
2007
IEEE
134views Database» more  ICDE 2007»
14 years 9 months ago
Efficient Top-k Query Evaluation on Probabilistic Data
Modern enterprise applications are forced to deal with unreliable, inconsistent and imprecise information. Probabilistic databases can model such data naturally, but SQL query eva...
Christopher Re, Nilesh N. Dalvi, Dan Suciu