Sciweavers

11 search results - page 2 / 3
» A Comparison of Memetic Recombination Operators for the MinL...
Sort
View
AISB
1994
Springer
13 years 9 months ago
Formal Memetic Algorithms
Abstract. A formal, representation-independent form of a memetic algorithm-a genetic algorithm incorporating local search--is introduced. A generalisedform of N-point crossover is ...
Nicholas J. Radcliffe, Patrick D. Surry
EC
2010
157views ECommerce» more  EC 2010»
13 years 5 months ago
Memetic Algorithms for Continuous Optimisation Based on Local Search Chains
Memetic algorithms with continuous local search methods have arisen as effective tools to address the difficulty of obtaining reliable solutions of high precision for complex cont...
Daniel Molina, Manuel Lozano, Carlos García...
IWANN
2001
Springer
13 years 9 months ago
A Comparison of Several Evolutionary Heuristics for the Frequency Assignment Problem
Abstract. The Frequency Assignment Problem (FAP) is a very important problem of practical interest. This work compares several evolutionary approaches to this problem, based both i...
Carlos Cotta, José M. Troya
AEI
2005
99views more  AEI 2005»
13 years 5 months ago
Comparison among five evolutionary-based optimization algorithms
Evolutionary algorithms (EAs) are stochastic search methods that mimic the natural biological evolution and/or the social behavior of species. Such algorithms have been developed ...
Emad Elbeltagi, Tarek Hegazy, Donald E. Grierson
FSTTCS
1998
Springer
13 years 9 months ago
Alternative Computational Models: A Comparison of Biomolecular and Quantum Computation
Molecular Computation (MC) is massively parallel computation where data is stored and processed within objects of molecular size. Biomolecular Computation (BMC) is MC using biotec...
John H. Reif