Sciweavers

61 search results - page 6 / 13
» A Comparison of Evolutionary Methods for the Discovery of Lo...
Sort
View
CEC
2011
IEEE
12 years 7 months ago
Cost-benefit analysis of using heuristics in ACGP
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
John W. Aleshunas, Cezary Z. Janikow
WCRE
2002
IEEE
14 years 12 days ago
Applying Spectral Methods to Software Clustering
The application of spectral methods to the software clustering problem has the advantage of producing results that are within a known factor of the optimal solution. Heuristic sea...
Ali Shokoufandeh, Spiros Mancoridis, Matthew Mayco...
GECCO
2004
Springer
14 years 27 days ago
Towards a Generally Applicable Self-Adapting Hybridization of Evolutionary Algorithms
When applied to real-world problems, the powerful optimization tool of Evolutionary Algorithms frequently turns out to be too time-consuming due to elaborate fitness calculations t...
Wilfried Jakob, Christian Blume, Georg Bretthauer
GECCO
2007
Springer
150views Optimization» more  GECCO 2007»
14 years 1 months ago
Credit assignment in adaptive memetic algorithms
Adaptive Memetic Algorithms couple an evolutionary algorithm with a number of local search heuristics for improving the evolving solutions. They are part of a broad family of meta...
J. E. Smith
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
14 years 1 months ago
A new evolutionary model for detecting multiple optima
Multimodal optimization problems consist in detecting all global and local optima of a problem. A new evolutionary approach to multimodal optimization called Roaming technique (RO...
Rodica Ioana Lung, D. Dumitrescu