32 search results - page 4 / 7 » Online Convex Programming and regularization in adaptive con... |
148
click to vote
GLOBECOM
2010
IEEE
15 years 2 months ago
2010
IEEE
We investigate flow rate optimization on a wireless link with randomly varying channel gain using techniques from adaptive modulation and network utility maximization. We consider ...
153
click to vote
NIPS
1996
15 years 5 months ago
1996
Dynamic Programming, Q-learning and other discrete Markov Decision Process solvers can be applied to continuous d-dimensional state-spaces by quantizing the state space into an arr...
130
click to vote
CC
2002
Springer
15 years 4 months ago
2002
Springer
We present an efficient online subpath profiling algorithm, OSP, that reports hot subpaths executed by a program in a given run. The hot subpaths can start at arbitrary basic block...
141
click to vote
SIAMSC
2010
15 years 2 months ago
2010
Frequently, the computation of derivatives for optimizing time-dependent problems is based on the integration of the adjoint differential equation. For this purpose, the knowledge...
150
click to vote
JSAC
2008
15 years 4 months ago
2008
In this paper, we study the theoretical problem of the end-to-end rate assignment for multi-hop wireless networks. Specifically, we consider the problem of joint congestion control...