14165 search results - page 364 / 2833 » The generalized two-server problem |
260
click to vote
APPROX
2011
Springer
14 years 6 months ago
2011
Springer
In this work we consider the problem of approximating the number of relevant variables in a function given query access to the function. Since obtaining a multiplicative factor ap...
378
click to vote
Publication
In the Bayesian approach to sequential decision making, exact calculation of the (subjective) utility is intractable. This extends to most special cases of interest, such as reinfo...
173
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
We present a bandit algorithm, SAO (Stochastic and Adversarial Optimal), whose regret is, essentially, optimal both for adversarial rewards and for stochastic rewards. Specifical...
230
click to vote
JMLR
2012
13 years 9 months ago
2012
In this paper, we propose a novel formulation of the network clique detection problem by introducing a general network data representation framework. We show connections between o...
202
click to vote
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
Abstract— We consider a wireless broadcast station that transmits packets to multiple users. The packet requests for each user may overlap, and some users may already have certai...