Applying elementary landscape analysis to search-based software engineering

Guanzhou LU; Rami BAHSOON; Xin YAO

doi:10.1109/SSBSE.2010.10

Applying elementary landscape analysis to search-based software engineering

Guanzhou LU, Rami BAHSOON, Xin YAO

Research output: Book Chapters | Papers in Conference Proceedings › Conference paper (refereed) › Research › peer-review

11 Citations (Scopus)

Abstract

Recent research in search-based software engineering (SBSE) has demonstrated that a number of software engineering problems can be reformulated as a search problem, hence search algorithms can be applied to tackle it. However, most of the existing work has been of empirical nature and the techniques are predominately experimental. Therefore in-depth studies into characteritics of SE problems and appropriate algorithms to solve them are necessary. In this paper, we propose a novel method to gain insight knowledge on a variant of the next release problem (NRP) using elementary landscape analysis, which could be used to guide the design of more efficient algorithms. Preliminary experimental results are obtained to indicate the effectiveness of the proposed method. © 2010 IEEE.

Original language	English
Title of host publication	Proceedings - 2nd International Symposium on Search Based Software Engineering, SSBSE 2010
Pages	3-8
Number of pages	6
DOIs	https://doi.org/10.1109/SSBSE.2010.10
Publication status	Published - Sept 2010
Externally published	Yes

Access to Document

10.1109/SSBSE.2010.10

Cite this

@inproceedings{fb0044a2933d4d64a24ce7fac969e76f,

title = "Applying elementary landscape analysis to search-based software engineering",

abstract = "Recent research in search-based software engineering (SBSE) has demonstrated that a number of software engineering problems can be reformulated as a search problem, hence search algorithms can be applied to tackle it. However, most of the existing work has been of empirical nature and the techniques are predominately experimental. Therefore in-depth studies into characteritics of SE problems and appropriate algorithms to solve them are necessary. In this paper, we propose a novel method to gain insight knowledge on a variant of the next release problem (NRP) using elementary landscape analysis, which could be used to guide the design of more efficient algorithms. Preliminary experimental results are obtained to indicate the effectiveness of the proposed method. {\textcopyright} 2010 IEEE.",

author = "Guanzhou LU and Rami BAHSOON and Xin YAO",

year = "2010",

month = sep,

doi = "10.1109/SSBSE.2010.10",

language = "English",

isbn = "9780769541952",

pages = "3--8",

booktitle = "Proceedings - 2nd International Symposium on Search Based Software Engineering, SSBSE 2010",

}

TY - GEN

T1 - Applying elementary landscape analysis to search-based software engineering

AU - LU, Guanzhou

AU - BAHSOON, Rami

AU - YAO, Xin

PY - 2010/9

Y1 - 2010/9

N2 - Recent research in search-based software engineering (SBSE) has demonstrated that a number of software engineering problems can be reformulated as a search problem, hence search algorithms can be applied to tackle it. However, most of the existing work has been of empirical nature and the techniques are predominately experimental. Therefore in-depth studies into characteritics of SE problems and appropriate algorithms to solve them are necessary. In this paper, we propose a novel method to gain insight knowledge on a variant of the next release problem (NRP) using elementary landscape analysis, which could be used to guide the design of more efficient algorithms. Preliminary experimental results are obtained to indicate the effectiveness of the proposed method. © 2010 IEEE.

AB - Recent research in search-based software engineering (SBSE) has demonstrated that a number of software engineering problems can be reformulated as a search problem, hence search algorithms can be applied to tackle it. However, most of the existing work has been of empirical nature and the techniques are predominately experimental. Therefore in-depth studies into characteritics of SE problems and appropriate algorithms to solve them are necessary. In this paper, we propose a novel method to gain insight knowledge on a variant of the next release problem (NRP) using elementary landscape analysis, which could be used to guide the design of more efficient algorithms. Preliminary experimental results are obtained to indicate the effectiveness of the proposed method. © 2010 IEEE.

UR - http://www.scopus.com/inward/record.url?scp=79952053137&partnerID=8YFLogxK

U2 - 10.1109/SSBSE.2010.10

DO - 10.1109/SSBSE.2010.10

M3 - Conference paper (refereed)

SN - 9780769541952

SP - 3

EP - 8

BT - Proceedings - 2nd International Symposium on Search Based Software Engineering, SSBSE 2010

ER -

Applying elementary landscape analysis to search-based software engineering

Abstract

Access to Document

Other files and links

Fingerprint

Cite this