3049 search results - page 312 / 610 » On the Convergence of Bound Optimization Algorithms |
142
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
We present a modified version of Differential Evolution (DE) for locating the global minimum at a higher convergence velocity. The proposed model differs from conventional DE by a...
177
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract-- Identification of output error models from frequency domain data generally results in a non-convex optimization problem. A well-known method to approach the output error...
190
click to vote
GECCO
2003
Springer
15 years 12 months ago
2003
Springer
The problem of searching for a walker that wants to be found, when the walker moves toward the helicopter when it can hear it, is an example of a two sided search problem which is ...
199
click to vote
GECCO
2010
Springer
15 years 11 months ago
2010
Springer
Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each offsp...
202
click to vote
PDPTA
2000
15 years 8 months ago
2000
Exploiting compile time knowledge to improve memory bandwidth can produce noticeable improvements at run-time [13, 1]. Allocating the data structure [13] to separate memories when...