3049 search results - page 94 / 610 » On the Convergence of Bound Optimization Algorithms |
162
click to vote
ANTSW
2008
Springer
15 years 6 months ago
2008
Springer
An adaptive particle swarm optimization (APSO) that features better search efficiency than classical particle swarm optimization (PSO) is presented. More importantly, it can perfor...
170
click to vote
STOC
2007
ACM
16 years 4 months ago
2007
ACM
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
147
click to vote
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
—The paper addresses the problem of massive content distribution in the network where multiple sessions coexist. In the traditional approaches, the sessions form separate overlay...
124
click to vote
NIPS
2008
15 years 5 months ago
2008
Large-margin structured estimation methods minimize a convex upper bound of loss functions. While they allow for efficient optimization algorithms, these convex formulations are n...
147
click to vote
KES
2004
Springer
15 years 9 months ago
2004
Springer
There is now a huge amount of high quality photometric data available in the literature whose analysis is bound to play a fundamental role in studies of the formation and evolution...