17 search results - page 2 / 4 » Stochastic coalescence in logarithmic time |
COLT
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Considering one-dimensional continuum-armed bandit problems, we propose an improvement of an algorithm of Kleinberg and a new set of conditions which give rise to improve...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
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...
145
click to vote
TOMACS
2011
14 years 4 months ago
2011
We consider the problem of the exact simulation of random variables Z that satisfy the distributional identity Z L = V Y + (1 − V )Z, where V ∈ [0, 1] and Y are independent, an...
APPROX
2010
Springer
14 years 11 months ago
2010
Springer
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
CORR
2010
Springer
14 years 7 months ago
2010
Springer
Internet advertising is a sophisticated game in which the many advertisers "play" to optimize their return on investment. There are many "targets" for the adve...