Memetic Algorithms: The Polynomial Local Search Complexity Theory Perspective
JOURNAL OF MATHEMATICAL MODELLING AND ALGORITHMS ; 7 , 1 ; 3-24
2008-01-01
22 pages
Aufsatz (Zeitschrift)
Englisch
DDC: | 003.3 |
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Efficient Batch Job Scheduling in Grids Using Cellular Memetic Algorithms
British Library Online Contents | 2008
|Multi-Objective Optimization of Helicopter Airfoils Using Surrogate-Assisted Memetic Algorithms
Online Contents | 2012
|Demonstrating Polynomial Run-time Growth for Local Search Matching
British Library Conference Proceedings | 1995
|Hybrid Flow-Shop: a Memetic Algorithm Using Constraint-Based Scheduling for Efficient Search
British Library Online Contents | 2009
|