835 search results - page 92 / 167 » Adaptive Bound Optimization for Online Convex Optimization |
CDC
2010
IEEE
14 years 4 months ago
2010
IEEE
This paper deals with the existence and synthesis of parameterized-(control) Lyapunov functions (p-(C)LFs) for discrete-time nonlinear systems that are possibly subject to constrai...
ATVA
2011
Springer
13 years 9 months ago
2011
Springer
In [AKL10], we showed how viewing online algorithms as reactive systems enables the application of ideas from formal verification to the competitive analysis of online algorithms....
EMSOFT
2007
Springer
15 years 4 months ago
2007
Springer
Design space exploration of embedded systems typically focuses on classical design goals such as cost, timing, buffer sizes, and power consumption. Robustness criteria, i.e. sensi...
SAGA
2009
Springer
15 years 4 months ago
2009
Springer
In the economical caching problem, an online algorithm is given a sequence of prices for a certain commodity. The algorithm has to manage a buffer of fixed capacity over time. We...
118
click to vote
TIT
2010
14 years 4 months ago
2010
Motivated by a recent surge of interest in convex optimization techniques, convexity/concavity properties of error rates of the maximum likelihood detector operating in the AWGN ch...