Sciweavers

1806 search results - page 205 / 362
» Randomness and halting probabilities
Sort
View
SODA
2008
ACM
97views Algorithms» more  SODA 2008»
15 years 5 months ago
Stochastic analyses for online combinatorial optimization problems
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
Naveen Garg, Anupam Gupta, Stefano Leonardi, Piotr...
125
Voted
FCS
2006
15 years 5 months ago
Principles of Optimal Probabilistic Decision Tree Construction
Probabilistic (or randomized) decision trees can be used to compute Boolean functions. We consider two types of probabilistic decision trees - one has a certain probability to give...
Laura Mancinska, Maris Ozols, Ilze Dzelme-Berzina,...
121
Voted
FLAIRS
2006
15 years 5 months ago
Melody Track Identification in Music Symbolic Files
Standard MIDI files contain data that can be considered as a symbolic representation of music (a digital score), and most of them are structured as a number of tracks, one of them...
David Rizo, Pedro J. Ponce de León, Antonio...
113
Voted
UAI
2001
15 years 5 months ago
Hypothesis Management in Situation-Specific Network Construction
This paper considers the problem of knowledgebased model construction in the presence of uncertainty about the association of domain entities to random variables. Multi-entity Bay...
Kathryn B. Laskey, Suzanne M. Mahoney, Ed Wright
112
Voted
WSC
2004
15 years 5 months ago
A Large Deviations Perspective on Ordinal Optimization
We consider the problem of optimal allocation of computing budget to maximize the probability of correct selection in the ordinal optimization setting. This problem has been studi...
Peter W. Glynn, Sandeep Juneja