Search--based approaches to the component selection and prioritization problem

Authors:
Mark Harman;Alexandros Skaliotis;Kathleen Steinhöfel;Paul Baker
Affiliations:
King's College, London, UK;King's College, London, UK;King's College, London, UK;Motorola Labs, Basingstoke, UK
Venue:
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Year:
2006

Citing 4
Cited 3

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Estimating Software Project Effort Using Analogies

IEEE Transactions on Software Engineering
A Study of Effective Regression Testing in Practice

ISSRE '97 Proceedings of the Eighth International Symposium on Software Reliability Engineering
On test suite composition and cost-effective regression testing

ACM Transactions on Software Engineering and Methodology (TOSEM)

A study of the bi-objective next release problem

Empirical Software Engineering
Search-based software engineering: Trends, techniques and applications

ACM Computing Surveys (CSUR)
Empirical evaluation of search based requirements interaction management

Information and Software Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

This poster paper addresses the problem of choosing sets of software components to combine in component--based software engineering. It formulates both ranking and selection problems as feature subset selection problems to which search based software engineering can be applied. We will consider selection and ranking of elements from a set of software components from the component base of a large telecommunications organisation.