1277 search results - page 185 / 256 » Terminating Decision Algorithms Optimally |
146
Voted
SPIN
2010
Springer
15 years 2 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 ...
84
Voted
AISS
2010
15 years 1 months ago
2010
HW/SW communication mode makes significant impact on HW/SW communication efficiency. Based on the characteristics of the hardware functions, this paper presents an adaptive HW/SW ...
170
Voted
IOR
2011
14 years 10 months ago
2011
This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several important areas employing graph-based ...
348
Voted
ICDE
2008
IEEE
17 years 3 months ago
2008
IEEE
Recently, there has been much interest in processing skyline queries for various applications that include decision making, personalized services, and search pruning. Skyline queri...
97
Voted
ECML
2001
Springer
15 years 8 months ago
2001
Springer
When correct priors are known, Bayesian algorithms give optimal decisions, and accurate confidence values for predictions can be obtained. If the prior is incorrect however, these...