3049 search results - page 102 / 610 » On the Convergence of Bound Optimization Algorithms |
144
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
We show how to extend the ICP framework to nonrigid registration, while retaining the convergence properties of the original algorithm. The resulting optimal step nonrigid ICP fra...
152
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
This work presents a best-first anytime algorithm for computing optimal coalition structures. The approach is novel in that it generates coalition structures based on coalition va...
109
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
We study the update of the distribution in Estimation of Distribution Algorithms, and show that a simple modiļ¬cation leads to unbiased estimates of the optimum. The simple modiļ...
166
click to vote
SAC
2011
ACM
14 years 7 months ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
150
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
Quantum-inspired evolutionary algorithms (QIEAs), as a subset of evolutionary computation, are based on the principles of quantum computing such as quantum bits and quantum superp...