17760 search results - page 300 / 3552 » A Generalization of the Massey-Ding Algorithm |
172
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
Hill-climbing has been shown to be more effective than exhaustive search in solving satisfiability problems.Also, it has been used either by itself or in combination with other ...
154
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
This article arguments that rank correlation coefficients are powerful association measures and how can they be adopted by EDAs. A new EDA implements the proposed ideas: the Non-P...
204
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
We investigate a bi-variate probabilistic model-building GA for the graph bipartitioning problem. The graph bipartitioning problem is a grouping problem that requires some modifi...
198
click to vote
CEC
2007
IEEE
15 years 7 months ago
2007
IEEE
— Memetic algorithms (MAs) combine the global exploration abilities of evolutionary algorithms with a local search to further improve the solutions. While a neighborhood can be e...
130
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In this paper we present novel algorithmic solutions for several resource processing and data transfer multicriteria optimization problems. The results of most of the presented tec...