1277 search results - page 136 / 256 » Terminating Decision Algorithms Optimally |
132
Voted
CORR
2004
Springer
15 years 3 months ago
2004
Springer
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
129
click to vote
APPROX
2005
Springer
15 years 9 months 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...
139
Voted
KI
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. In this paper, a framework for previous and new quasi-exact extensions of the A -algorithm is presented. In contrast to previous approaches, the new methods guarantee to ...
126
Voted
ISCC
2005
IEEE
15 years 9 months ago
2005
IEEE
Abstract Content Delivery Networks (CDNs) provide an efficient support for serving http and streaming media content while minimizing the network impact of content delivery as well...
144
click to vote
IM
2007
15 years 5 months ago
2007
— We consider whether the off-line compilation of a set of Service Level Agreements (SLAs) into low-level management policies can lead to the runtime maximization of the overall ...