3049 search results - page 8 / 610 » On the Convergence of Bound Optimization Algorithms |
131
click to vote
ICML
2010
IEEE
15 years 2 months ago
2010
IEEE
Many applications require optimizing an unknown, noisy function that is expensive to evaluate. We formalize this task as a multiarmed bandit problem, where the payoff function is ...
140
click to vote
ICDCN
2009
Springer
15 years 8 months ago
2009
Springer
Given a set of robots with arbitrary initial location and no agreement on a global coordinate system, convergence requires that all robots asymptotically approach the exact same, ...
100
Voted
SODA
2010
ACM
15 years 11 months ago
2010
ACM
Spectral methods have been widely used in a broad range of application fields. One important object involved in such methods is the Laplace-Beltrami operator of a manifold. Indeed...
128
click to vote
CDC
2009
IEEE
14 years 11 months ago
2009
IEEE
Abstract-- The problem of finding the eigenvector corresponding to the largest eigenvalue of a stochastic matrix has numerous applications in ranking search results, multi-agent co...
106
click to vote
CEC
2007
IEEE
15 years 8 months ago
2007
IEEE
— We present an ant model that solves a discrete foraging problem. We describe simulations and provide a complete convergence analysis: we show that the ant population computes t...