4007 search results - page 113 / 802 » Computation with imprecise probabilities |
106
Voted
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
We propose a modified discrete HMM that includes a feature weighting discrimination component. We assume that the feature space is partitioned into subspaces and that the relevan...
141
click to vote
SPIN
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We develop an algorithm to compute timed reachability probabilities for distributed models which are both probabilistic and nondeterministic. To obtain realistic results ...
157
Voted
COMMA
2010
14 years 10 months ago
2010
Abstract. We propose an argumentation framework for modelling jury-based dispute resolution where the dispute parties present their arguments before a judge and a jury. While the j...
149
click to vote
ATAL
2009
Springer
2009
Springer
Effective solutions for real-world Stackelberg games: when agents must deal with human uncertainties
15 years 10 months ago
How do we build multiagent algorithms for agent interactions with human adversaries? Stackelberg games are natural models for many important applications that involve human intera...
118
Voted
SIGMETRICS
2006
ACM
15 years 9 months ago
2006
ACM
This work analyzes the connectivity of large diameter networks where every link has an independent probability p of failure. We give a (relatively simple) topological condition th...