Sciweavers

978 search results - page 95 / 196
» Knowledge, Probability, and Adversaries
Sort
View
CP
2004
Springer
15 years 3 months ago
How Much Backtracking Does It Take to Color Random Graphs? Rigorous Results on Heavy Tails
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...
Haixia Jia, Cristopher Moore
COCOON
2007
Springer
15 years 1 months ago
Efficient Testing of Forecasts
Each day a weather forecaster predicts a probability of each type of weather for the next day. After n days, all the predicted probabilities and the real weather data are sent to a...
Ching-Lueh Chang, Yuh-Dauh Lyuu
NIPS
2007
14 years 11 months ago
Optimistic Linear Programming gives Logarithmic Regret for Irreducible MDPs
We present an algorithm called Optimistic Linear Programming (OLP) for learning to optimize average reward in an irreducible but otherwise unknown Markov decision process (MDP). O...
Ambuj Tewari, Peter L. Bartlett
UAI
2004
14 years 11 months ago
Pre-Selection of Independent Binary Features: An Application to Diagnosing Scrapie in
Suppose that the only available information in a multi-class problem are expert estimates of the conditional probabilities of occurrence for a set of binary features. The aim is t...
Ludmila I. Kuncheva, Christopher J. Whitaker, Pete...
AAAI
1996
14 years 11 months ago
A Clinician's Tool for Analyzing Non-Compliance
We describe a computer program to assist a clinician with assessing the e cacy of treatments in experimental studies for which treatment assignment is random but subject complianc...
David Maxwell Chickering, Judea Pearl