Sciweavers

347 search results - page 5 / 70
» Online model-based adaptation for optimizing performance and...
Sort
View
ECCC
2007
180views more  ECCC 2007»
13 years 7 months ago
Adaptive Algorithms for Online Decision Problems
We study the notion of learning in an oblivious changing environment. Existing online learning algorithms which minimize regret are shown to converge to the average of all locally...
Elad Hazan, C. Seshadhri
COMCOM
2010
95views more  COMCOM 2010»
13 years 6 months ago
Trading link utilization for queueing delays: An adaptive approach
Understanding the relationship between queueing delays and link utilization for general traffic conditions is an important open problem in networking research. Difficulties in und...
Rade Stanojevic, Robert Shorten
COLT
2008
Springer
13 years 9 months ago
High-Probability Regret Bounds for Bandit Online Linear Optimization
We present a modification of the algorithm of Dani et al. [8] for the online linear optimization problem in the bandit setting, which with high probability has regret at most O ( ...
Peter L. Bartlett, Varsha Dani, Thomas P. Hayes, S...
ICMCS
2006
IEEE
125views Multimedia» more  ICMCS 2006»
14 years 1 months ago
Online Doubletalk Detector Calibration for Acoustic Echo Cancellation in Videoconferencing Systems
This paper addresses the problem of doubletalk detector calibration for acoustic echo cancellers in hands-free environments such as videoconferencing. A statistical model of a rec...
James D. Gordy, Rafik A. Goubran
CGO
2009
IEEE
14 years 2 months ago
Scenario Based Optimization: A Framework for Statically Enabling Online Optimizations
Abstract—Online optimization allows the continuous restructuring and adaptation of an executing application using live information about its execution environment. The further ad...
Jason Mars, Robert Hundt