Sciweavers

835 search results - page 17 / 167
» Adaptive Bound Optimization for Online Convex Optimization
Sort
View
ALT
2008
Springer
14 years 7 months ago
Online Regret Bounds for Markov Decision Processes with Deterministic Transitions
Abstract. We consider an upper confidence bound algorithm for Markov decision processes (MDPs) with deterministic transitions. For this algorithm we derive upper bounds on the onl...
Ronald Ortner
DRR
2010
14 years 23 days ago
Time and space optimization of document content classifiers
Scaling up document-image classifiers to handle an unlimited variety of document and image types poses serious challenges to conventional trainable classifier technologies. Highly...
Dawei Yin, Henry S. Baird, Chang An
INFOCOM
2006
IEEE
14 years 4 months ago
On the Performance of Joint Rate/Power Control with Adaptive Modulation in Wireless CDMA Networks
Abstract— Adaptive rate/power control schemes have great potential to increase the throughput of wireless CDMA networks. In this paper, we investigate the additional gains achiev...
Alaa Muqattash, Tao Shu, Marwan Krunz
GECCO
2006
Springer
205views Optimization» more  GECCO 2006»
14 years 2 months ago
Bounding XCS's parameters for unbalanced datasets
This paper analyzes the behavior of the XCS classifier system on imbalanced datasets. We show that XCS with standard parameter settings is quite robust to considerable class imbal...
Albert Orriols-Puig, Ester Bernadó-Mansilla
SIAMJO
2008
99views more  SIAMJO 2008»
13 years 10 months ago
The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
Many optimization problems are naturally delivered in an uncertain framework, and one would like to exercise prudence against the uncertainty elements present in the problem. In pr...
Marco C. Campi, Simone Garatti