Cargando…
On Easiest Functions for Mutation Operators in Bio-Inspired Optimisation
Understanding which function classes are easy and which are hard for a given algorithm is a fundamental question for the analysis and design of bio-inspired search heuristics. A natural starting point is to consider the easiest and hardest functions for an algorithm. For the (1+1) EA using standard...
| Autores principales: | , , , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer US
2016
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7010401/ https://www.ncbi.nlm.nih.gov/pubmed/32103848 http://dx.doi.org/10.1007/s00453-016-0201-4 |