3049 search results - page 99 / 610 » On the Convergence of Bound Optimization Algorithms |
132
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
A quality-time analysis of multi-objective evolutionary algorithms (MOEAs) based on schema theorem and building blocks hypothesis is developed. A bicriteria OneMax problem, a hypo...
148
click to vote
ATAL
2009
Springer
15 years 11 months ago
2009
Springer
Distributed Lagrangian Relaxation Protocol (DisLRP) has been proposed to solve a distributed combinatorial maximization problem called the Generalized Mutual Assignment Problem (G...
137
click to vote
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
Abstract-- Local convergence is a limitation of many optimization approaches for multimodal functions. For hybrid model learning, this can mean a compromise in accuracy. We develop...
172
click to vote
IICAI
2003
15 years 5 months ago
2003
Minimum vertex cover problem (MVCP) is an NP-hard problem and it has numerous real life applications. This paper presents hybrid genetic algorithm (HGA) to solve MVCP efficiently. ...
140
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
Instead of having fixed px and pm, this paper presents the use of fuzzy logic to adaptively tune px and pm for optimization of power electronic circuits throughout the process. By...