835 search results - page 29 / 167 » Adaptive Bound Optimization for Online Convex Optimization |
INFOCOM
2012
IEEE
12 years 25 days ago
2012
IEEE
—We study two convex optimization problems in a multi-class M/G/1 queue with adjustable service rates: minimizing convex functions of the average delay vector, and minimizing ave...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
In high density (HD) mesh networks, packet losses can occur due to co-channel interference (asynchronous interference) or collisions (synchronous interference). In this paper, we f...
SIGECOM
2011
ACM
13 years 1 months ago
2011
ACM
We present the results of a large field experiment on setting reserve prices in auctions for online advertisements, guided by the theory of optimal auction design suitably adapte...
SPAA
1996
ACM
14 years 2 months ago
1996
ACM
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
TROB
2008
13 years 10 months ago
2008
An important problem in the control of locomotion of robots with multiple degrees of freedom (e.g., biomimetic robots) is to adapt the locomotor patterns to the properties of the e...