Sciweavers

403 search results - page 42 / 81
» Sampling Bounds for Stochastic Optimization
Sort
View
JMLR
2006
105views more  JMLR 2006»
13 years 10 months ago
Some Theory for Generalized Boosting Algorithms
We give a review of various aspects of boosting, clarifying the issues through a few simple results, and relate our work and that of others to the minimax paradigm of statistics. ...
Peter J. Bickel, Yaacov Ritov, Alon Zakai
CPAIOR
2005
Springer
14 years 3 months ago
Mixed Discrete and Continuous Algorithms for Scheduling Airborne Astronomy Observations
We describe the problem of scheduling astronomy observations for the Stratospheric Observatory for Infrared Astronomy, an airborne telescope. The problem requires maximizing the nu...
Jeremy Frank, Elif Kürklü
CDC
2010
IEEE
105views Control Systems» more  CDC 2010»
13 years 4 months ago
Universal scheduling for networks with arbitrary traffic, channels, and mobility
We extend stochastic network optimization theory to treat networks with arbitrary sample paths for arrivals, channels, and mobility. The network can experience unexpected link or n...
Michael J. Neely
JSAC
2006
89views more  JSAC 2006»
13 years 9 months ago
Robust multiuser detection for multicarrier CDMA systems
Abstract--Multiuser detection (MUD) for code-division multiple-access (CDMA) systems usually relies on some a priori channel estimates, which are obtained either blindly or by usin...
Rensheng Wang, Hongbin Li, Tao Li
WIOPT
2011
IEEE
13 years 1 months ago
Network utility maximization over partially observable Markovian channels
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...
Chih-Ping Li, Michael J. Neely