2095 search results - page 63 / 419 » Improved pebbling bounds |
114
click to vote
NIPS
2004
15 years 2 months ago
2004
In the multi-armed bandit problem, an online algorithm must choose from a set of strategies in a sequence of n trials so as to minimize the total cost of the chosen strategies. Wh...
70
Voted
CORR
2010
Springer
15 years 26 days ago
2010
Springer
We give a new insight into the upper bounding of the 3-SAT threshold by the first moment method. The best criteria developed so far to select the solutions to be counted discrimina...
112
Voted
MOC
2002
15 years 13 days ago
2002
Abstract. In this paper, we provide tight estimates for the divisor class number of hyperelliptic function fields. We extend the existing methods to any hyperelliptic function fiel...
88
Voted
CORR
2008
Springer
14 years 11 months ago
2008
Springer
The capacity of 1-D constraints is given by the entropy of a corresponding stationary maxentropic Markov chain. Namely, the entropy is maximized over a set of probability distribut...
105
Voted
SODA
2003
ACM
15 years 2 months ago
2003
ACM
We consider packet scheduling in a network providing differentiated services, where each packet is assigned a value. We study various queueing models for supporting QoS (Quality ...