7978 search results - page 302 / 1596 » Combining shared-coin algorithms |
159
click to vote
GECCO
2004
Springer
15 years 10 months ago
2004
Springer
Hybrid algorithms that combine genetic algorithms with the Nelder-Mead simplex algorithm have been effective in solving certain optimization problems. In this article, we apply a s...
128
click to vote
ICALP
2003
Springer
15 years 10 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
167
click to vote
KES
1999
Springer
15 years 9 months ago
1999
Springer
Abstract—Dynamic Demes is a new method for the parallelisation of evolutionary algorithms. It was derived as a combination of two other parallelisation algorithms: the master-sla...
137
click to vote
GECCO
2008
Springer
15 years 6 months ago
2008
Springer
In recent years, the development of multi-objective evolutionary algorithms (MOEAs) hybridized with mathematical programming techniques has significantly increased. However, most...
151
click to vote
TPDS
2008
15 years 4 months ago
2008
Abstract-- With increasing richness in features such as personalization of content, web applications are becoming more complex and hence compute intensive. Traditional approaches t...