An analysis on separability for Memetic Computing automatic design
- Submitting institution
-
University of Nottingham, The
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 3705514
- Type
- D - Journal article
- DOI
-
10.1016/j.ins.2013.12.044
- Title of journal
- Information Sciences
- Article number
- -
- First page
- 1
- Volume
- 265
- Issue
- -
- ISSN
- 0020-0255
- Open access status
- Out of scope for open access requirements
- Month of publication
- May
- Year of publication
- 2014
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
-
- Citation count
- 66
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- One fundamental challenge in optimisation is the automatic design of algorithms. Unlike most of the conceptual works present in the literature, this paper offers a working prototype based on a fitness landscape analysis that estimates the operational separability of the problem to optimise. This work is linked to the project funded by Academy of Finland “Algorithmic Design Issues in Memetic Computing” and is embedded in the software platform kimeme of cyberdyne.it. Two invited keynote talks (at SEMC13 and SocProS19 ) are linked to this paper.
Cyberdyne contact, Dr. Ernesto Mininno, ernesto.mininno@cyberdyne.it, CEO
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
