16404 search results - page 419 / 3281 » A set coverage problem |
197
click to vote
COLT
2003
Springer
15 years 12 months ago
2003
Springer
We consider the Multi-armed bandit problem under the PAC (“probably approximately correct”) model. It was shown by Even-Dar et al. [5] that given n arms, it suffices to play th...
159
click to vote
TACAS
2010
Springer
15 years 12 months ago
2010
Springer
We propose a general methodology for approximating the Pareto front of multi-criteria optimization problems. Our search-based methodology consists of submitting queries to a constr...
193
Voted
RANDOM
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. We consider approximate PCPs for multidimensional bin-packing problems. In particular, we show how a verifier can be quickly convinced that a set of multidimensional blo...
175
click to vote
ESA
1998
Springer
15 years 11 months ago
1998
Springer
Previous literature on the Traveling Salesman Problem (TSP) assumed that the sites to be visited are stationary. Motivated by practical applications, we introduce a time-dependent ...
172
click to vote
PARA
1994
Springer
15 years 10 months ago
1994
Springer
A model describing the full quantum mechanical three body problem of the hydrogen molecular ion is presented, and some of the numerical results are subsequently discussed. The ove...