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...
Guardado en:
| Publicado en: | Algorithmica |
|---|---|
| Autores principales: | , , , , , |
| Formato: | Artigo |
| Lenguaje: | Inglês |
| Publicado: |
Springer US
2016
|
| Materias: | |
| Acceso en línea: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7010401/ https://ncbi.nlm.nih.gov/pubmed/32103848 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1007/s00453-016-0201-4 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|