4377 search results - page 322 / 876 » Mass problems and randomness |
174
click to vote
WSC
2008
15 years 9 months ago
2008
We consider discrete stochastic optimization problems where the objective function can only be estimated by a simulation oracle; the oracle is defined only at the discrete points....
157
click to vote
AAAI
1997
15 years 8 months ago
1997
This paper steps back from the standard infinite horizon formulation of reinforcement learning problems to consider the simpler case of finite horizon problems. Although finite ho...
143
click to vote
MANSCI
2008
15 years 6 months ago
2008
We study an iterative cutting-plane algorithm on an integer program, for minimizing the staffing costs of a multiskill call center subject to service-level requirements which are e...
157
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We prove an optimal (n) lower bound on the randomized communication complexity of the much-studied GAP-HAMMING-DISTANCE problem. As a consequence, we obtain essentially optimal mu...
293
click to vote
SIAMCOMP
2011
14 years 9 months ago
2011
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...