3049 search results - page 381 / 610 » On the Convergence of Bound Optimization Algorithms |
129
click to vote
TIT
2008
15 years 4 months ago
2008
Abstract--This letter considers the average complexity of maximum-likelihood (ML) decoding of convolutional codes. ML decoding can be modeled as finding the most probable path take...
129
click to vote
SODA
2004
ACM
15 years 6 months ago
2004
ACM
We consider the problem of picking (buying) an inexpensive s-t path in a graph where edges are owned by independent (selfish) agents, and the cost of an edge is known to its owner...
146
Voted
SIAMJO
2002
15 years 4 months ago
2002
We study a class of generalized bundle methods for which the stabilizing term can be any closed convex function satisfying certain properties. This setting covers several algorithm...
179
click to vote
GECCO
2010
Springer
15 years 9 months ago
2010
Springer
Differential evolution (DE) is a simple yet powerful evolutionary algorithm for global numerical optimization. Different strategies have been proposed for the offspring generation...
133
click to vote
GECCO
2008
Springer
15 years 5 months ago
2008
Springer
XCS with computed prediction, namely XCSF, has been recently extended in several ways. In particular, a novel prediction update algorithm based on recursive least squares and the ...