3049 search results - page 47 / 610 » On the Convergence of Bound Optimization Algorithms |
115
click to vote
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
A novel optimisation accelerator deploying neural network predictions and objective space direct manipulation strategies is presented. The concept of directing the search through ...
133
click to vote
UAI
2008
15 years 3 months ago
2008
We address the problem of computing approximate marginals in Gaussian probabilistic models by using mean field and fractional Bethe approximations. As an extension of Welling and ...
106
click to vote
EOR
2008
15 years 2 months ago
2008
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
105
click to vote
PPSN
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We introduce a model for cooperative coevolutionary algorithms (CCEAs) using partial mixing, which allows us to compute the expected long-run convergence of such algorith...
SODA
2008
ACM
15 years 3 months ago
2008
ACM
It is known that the dynamics of best response in an environment of non-cooperative users may converge to a good solution when users play sequentially, but may cycle far away from...