Sciweavers

373 search results - page 8 / 75
» An ACO Algorithm for the Most Probable Explanation Problem
Sort
View
NOMS
2002
IEEE
130views Communications» more  NOMS 2002»
13 years 12 months ago
End-to-end service failure diagnosis using belief networks
We present fault localization techniques suitable for diagnosing end-to-end service problems in communication systems with complex topologies. We refine a layered system model th...
Malgorzata Steinder, Adarshpal S. Sethi
UAI
2008
13 years 8 months ago
Strategy Selection in Influence Diagrams using Imprecise Probabilities
This paper describes a new algorithm to solve the decision making problem in Influence Diagrams based on algorithms for credal networks. Decision nodes are associated to imprecise...
Cassio Polpo de Campos, Qiang Ji
FLAIRS
2000
13 years 8 months ago
A Deterministic Algorithm for Solving Imprecise Decision Problems
Today there are numerous tools for decision analysis, suitable both for human and artificial decision makers. Most of these tools require the decision maker to provide precise num...
Håkan L. S. Younes, Love Ekenberg
COLT
2008
Springer
13 years 8 months ago
High-Probability Regret Bounds for Bandit Online Linear Optimization
We present a modification of the algorithm of Dani et al. [8] for the online linear optimization problem in the bandit setting, which with high probability has regret at most O ( ...
Peter L. Bartlett, Varsha Dani, Thomas P. Hayes, S...
LWA
2004
13 years 8 months ago
A Simple Method For Estimating Conditional Probabilities For SVMs
Support Vector Machines (SVMs) have become a popular learning algorithm, in particular for large, high-dimensional classification problems. SVMs have been shown to give most accur...
Stefan Rüping