3049 search results - page 29 / 610 » On the Convergence of Bound Optimization Algorithms |
GECCO
2004
Springer
14 years 29 days ago
2004
Springer
Maximin strategy has its origin in game theory, but it can be adopted for effective multiobjective optimization. This paper proposes a particle swarm multiobjective optimiser, max...
COCOON
2009
Springer
14 years 2 months ago
2009
Springer
This paper explores the fundamental question of how many iterations the celebrated HITS algorithm requires on a general graph to converge in score and, perhaps more importantly, in...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— To proactively defend against intruders from readily jeopardizing single-path data sessions, we propose a distributed secure multipath solution to route data across multiple pa...
DATAMINE
2006
13 years 7 months ago
2006
Motivated by the poor performance (linear complexity) of the EM algorithm in clustering large data sets, and inspired by the successful accelerated versions of related algorithms l...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
We propose the use of rough sets theory to improve the first approximation provided by a multi-objective evolutionary algorithm and retain the nondominated solutions using a new ...