250 search results - page 21 / 50 » General variable neighborhood search for the continuous opti... |
ATAL
2010
Springer
14 years 12 months ago
2010
Springer
Distributed Constraints Optimization (DCOP) is a powerful framework for representing and solving distributed combinatorial problems, where the variables of the problem are owned b...
116
click to vote
EVOW
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We present the newly developed core concept for the Multidimensional Knapsack Problem (MKP) which is an extension of the classical concept for the one-dimensional case. T...
117
click to vote
GECCO
2010
Springer
15 years 4 months ago
2010
Springer
The fundamental dichotomy in evolutionary algorithms is that between exploration and exploitation. Recently, several algorithms [8, 9, 14, 16, 17, 20] have been introduced that gu...
111
click to vote
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
Wilson introduced XCSF as a successor to XCS. The major development of XCSF is the concept of a computed prediction. The efficiency of XCSF in dealing with numerical input and con...
GECCO
2005
Springer
15 years 5 months ago
2005
Springer
A powerful approach to search is to try to learn a distribution of good solutions (in particular of the dependencies between their variables) and use this distribution as a basis ...