1510 search results - page 129 / 302 » Upper Probabilities and Additivity |
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We consider the problem of optimally allocating a given total storage budget in a distributed storage system. A source has a data object which it can code and store over a set of s...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
We consider concurrent games played on graphs. At every round of the game, each player simultaneously and independently selects a move; the moves jointly determine the transition ...
CN
2007
14 years 10 months ago
2007
In multicast communication, a source transmits the same content to a set of receivers. Current protocols for multicast follow a tree communication model which makes them scalable....
104
click to vote
CORR
2007
Springer
14 years 10 months ago
2007
Springer
Bandit based methods for tree search have recently gained popularity when applied to huge trees, e.g. in the game of go [6]. Their efficient exploration of the tree enables to ret...
JMLR
2010
14 years 4 months ago
2010
This work deals with four classical prediction settings, namely full information, bandit, label efficient and bandit label efficient as well as four different notions of regret: p...