548 search results - page 48 / 110 » Optimization of Convex Risk Functions |
113
click to vote
NIPS
2004
15 years 1 months ago
2004
In the multi-armed bandit problem, an online algorithm must choose from a set of strategies in a sequence of n trials so as to minimize the total cost of the chosen strategies. Wh...
139
click to vote
INFOCOM
2012
IEEE
13 years 2 months ago
2012
IEEE
Abstract—The problem of minimizing queueing delay of opportunistic access of multiple continuous time Markov channels is considered. A new access policy based on myopic sensing a...
82
Voted
MP
2007
15 years 3 hour ago
2007
Many practical optimization problems involve nonsmooth (that is, not necessarily differentiable) functions of thousands of variables. In the paper [Haarala, Miettinen, M¨akel¨a,...
109
click to vote
CDC
2010
IEEE
14 years 7 months ago
2010
IEEE
We consider a multi-agent optimization problem where agents aim to cooperatively minimize a sum of local objective functions subject to a global inequality constraint and a global ...
101
Voted
AINA
2005
IEEE
15 years 6 months ago
2005
IEEE
The network lifetime for wireless sensor network plays an important role to survivability. Thus, we indicate the importance of routing protocol to network lifetime, and model the ...