2694 search results - page 10 / 539 » Fully Distributed Algorithms for Convex Optimization Problem... |
108
click to vote
COLT
2010
Springer
14 years 7 months ago
2010
Springer
Bandit convex optimization is a special case of online convex optimization with partial information. In this setting, a player attempts to minimize a sequence of adversarially gen...
113
click to vote
TWC
2008
14 years 9 months ago
2008
A novel framework was introduced recently for stochastic routing in wireless multihop networks, whereby each node selects a neighbor to forward a packet according to a probability...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We develop and analyze M-estimation methods for divergence functionals and the likelihood ratios of two probability distributions. Our method is based on a non-asymptotic variatio...
MOR
2006
14 years 9 months ago
2006
In multicriteria optimization, several objective functions, conflicting with each other, have to be minimized simultaneously. We propose a new efficient method for approximating t...
158
click to vote
FAW
2010
Springer
14 years 10 months ago
2010
Springer
We study problems in computational geometry from the viewpoint of adaptive algorithms. Adaptive algorithms have been extensively studied for the sorting problem, and in this paper ...