Abstract
The article at hand identifies two kinds of problem difficulty in dynamic environments: discontinuities in the fitness landscape caused by moving optima and the discrepancy between tracking and optimization. These problem difficulties are supported by theoretical considerations and experimental findings. Various methods of resolution are discussed and a new adaptation method, namely the correction of strategy variables, is proposed. © Springer-Verlag 2001.
Cite
CITATION STYLE
Weicker, K. (2001). Problem difficulty in real-valued dynamic problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2206 LNCS, pp. 313–325). Springer Verlag. https://doi.org/10.1007/3-540-45493-4_35
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
