3049 search results - page 179 / 610 » On the Convergence of Bound Optimization Algorithms |
166
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
This paper proposes a method to use reference points as preferences to guide a particle swarm algorithm to search towards preferred regions of the Pareto front. A decision maker c...
149
click to vote
ESA
2005
Springer
15 years 12 months ago
2005
Springer
The number of probes needed by the best possible algorithm for locally or globally optimizing a bivariate function varies substantially depending on the assumptions made about the ...
182
click to vote
AMC
2007
15 years 6 months ago
2007
In a distributed computing system (DCS), we need to allocate a number of modules to different processors for execution. It is desired to maximize the processor synergism in order...
201
click to vote
GECCO
2007
Springer
16 years 18 days ago
2007
Springer
When facing dynamic optimization problems the goal is no longer to find the extrema, but to track their progression through the space as closely as possible. Over these kind of ov...
203
click to vote
EC
2000
15 years 6 months ago
2000
In this paper, we provide a systematic comparison of various evolutionary approaches to multiobjective optimization using six carefully chosen test functions. Each test function i...