4007 search results - page 308 / 802 » Computation with imprecise probabilities |
136
click to vote
CONCUR
2009
Springer
15 years 11 months ago
2009
Springer
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). ...
147
click to vote
QEST
2007
IEEE
15 years 11 months ago
2007
IEEE
We investigate logics and equivalence relations that capture the qualitative behavior of Markov Decision Processes (MDPs). We present Qualitative Randomized Ctl (Qrctl): formulas o...
134
click to vote
ATAL
2007
Springer
15 years 11 months ago
2007
Springer
In this paper we develop a novel probabilistic model of computational trust that explicitly deals with correlated multi-dimensional contracts. Our starting point is to consider an...
163
click to vote
DIS
2007
Springer
15 years 11 months ago
2007
Springer
We describe a technique for comparing distributions without the need for density estimation as an intermediate step. Our approach relies on mapping the distributions into a reprodu...
137
click to vote
STACS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...