1331 search results - page 227 / 267 » Complexity bounds for zero-test algorithms |
CORR
2012
Springer
12 years 3 months ago
2012
Springer
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
SIGMETRICS
2004
ACM
14 years 1 months ago
2004
ACM
This paper develops and evaluates new share-based scheduling algorithms for differentiated service quality in network services, such as network storage servers. This form of resou...
ALT
1999
Springer
14 years 5 hour ago
1999
Springer
We introduce a new model for learning in the presence of noise, which we call the Nasty Noise model. This model generalizes previously considered models of learning with noise. Th...
JACM
2006
13 years 7 months ago
2006
"Experts algorithms" constitute a methodology for choosing actions repeatedly, when the rewards depend both on the choice of action and on the unknown current state of t...