835 search results - page 19 / 167 » Adaptive Bound Optimization for Online Convex Optimization |
186
click to vote
OSDI
2008
ACM
16 years 6 months ago
2008
ACM
Internet routing is mostly based on static information-it's dynamicity is limited to reacting to changes in topology. Adaptive performance-based routing decisions would not o...
171
click to vote
APPROX
2005
Springer
16 years 2 days ago
2005
Springer
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
178
click to vote
IPPS
2007
IEEE
16 years 25 days ago
2007
IEEE
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
168
click to vote
NIPS
2004
15 years 8 months ago
2004
We study a method of optimal data-driven aggregation of classifiers in a convex combination and establish tight upper bounds on its excess risk with respect to a convex loss funct...
197
click to vote
DATE
2008
IEEE
15 years 8 months ago
2008
IEEE
Adaptive resource management is critical to ensuring the quality of real-time distributed applications, particularly for energy-constrained mobile handheld devices. In this contex...