74 search results - page 12 / 15 » Random Debaters and the Hardness of Approximating Stochastic... |
WSC
2004
14 years 10 months ago
2004
We review the basic principles of Quasi-Monte Carlo (QMC) methods, the randomizations that turn them into variancereduction techniques, and the main classes of constructions under...
WIOPT
2011
IEEE
14 years 1 months ago
2011
IEEE
Abstract—This paper considers maximizing throughput utility in a multi-user network with partially observable Markov ON/OFF channels. Instantaneous channel states are never known...
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract—We study network optimization that considers energy minimization as an objective. Studies have shown that mechanisms such as speed scaling can significantly reduce the ...
89
Voted
PE
2010
Springer
14 years 7 months ago
2010
Springer
We consider a push pull queueing system with two servers and two types of jobs which are processed by the two servers in opposite order, with stochastic generally distributed proc...
SIAMCOMP
2010
14 years 7 months ago
2010
The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...