Citation
Quasi-Elementary Landscapes. In proceedings of the 5th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2011), 9-11 August 2011, Phoenix, Arizona, USA, pages 113-125, 2011.
Paper
Abstract
There exists local search landscapes where the evaluation function is an eigenfunction of the Laplacian that describes the graph that corresponds to the neighborhood structure of the search space. Problems that display this structure are called "Elementary Landscapes" and they have a number of special mathematical properties. In this paper we show that there exists landscapes that are almost" elementary. The landscapes can be described as being elmentary with some corrections to describe those part of the neighborhood structure that deviate from the normal structure found in elementary landscapes. The term Quasi-elementary landscapes" is introduced to describe these landscapes. Quasi-elementary can also be elementary for specific problem sizes, and not elementary for other problem sizes.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2011-113-125-P, author = {D. Whitley},
title = {Quasi-Elementary Landscapes},
booktitle = {In proceedings of the 5th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2011), 9-11 August 2011, Phoenix, Arizona, USA},
year = {2011},
editor = {J. Fowler and G. Kendall and B. McCollum},
pages = {113--125},
note = {Paper},
abstract = {There exists local search landscapes where the evaluation function is an eigenfunction of the Laplacian that describes the graph that corresponds to the neighborhood structure of the search space. Problems that display this structure are called "Elementary Landscapes" and they have a number of special mathematical properties. In this paper we show that there exists landscapes that are \almost" elementary. The landscapes can be described as being elmentary with some corrections to describe those part of the neighborhood structure that deviate from the normal structure found in elementary landscapes. The term \Quasi-elementary landscapes" is introduced to describe these landscapes. Quasi-elementary can also be elementary for specific problem sizes, and not elementary for other problem sizes.},
owner = {gxk},
timestamp = {2011.08.15},
webpdf = {2011-113-125-P.pdf} }