The class of symmetric functions is based on the OneMax function by a subsequent assigning application of a real valued function. In this work we derive a sharp boundary between those problem instances that are solvable in polynomial time by the Metropolis algorithm and those that need at least exponential time. This result is both proven theoretically and illustrated by experimental data. The classification of functions into easy and hard problem instances allows a deep insight into the problem solving power of the Metropolis algorithm and can be used in the process of selecting an optimization algorithm for a concrete problem instance. © Springer-Verlag Berlin Heidelberg 2009.
CITATION STYLE
Kaden, L., Weicker, N., & Weicker, K. (2009). Metropolis and symmetric functions: A swan song. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5482 LNCS, pp. 204–215). https://doi.org/10.1007/978-3-642-01009-5_18
Mendeley helps you to discover research relevant for your work.