Change search
ReferencesLink to record
Permanent link

Direct link
Search-based Improvement of Subsystem Decompositions
2005 (English)In: GECCO 2005: Genetic and Evolutionary Computation Conference, Vols 1 and 2, 2005, 1045-1051 p.Conference paper (Other academic)
Abstract [en]

The subsystem decomposition of a software system degrades gradually during its lifetime and therefore it gets harder and harder to maintain. As a result this decomposition needs to be reconditioned from time to time. The problem is to determine a suitable subsystem decomposition that can be used as a basis for future maintenance tasks. This paper describes a new methodology that computes such a subsystem decomposition by optimizing metrics and heuristics of good subsystem design. The main idea is to treat this task as a search problem and to solve it using a genetic algorithm.

Place, publisher, year, edition, pages
2005. 1045-1051 p.
Keyword [en]
clustering, genetic, reengineering
National Category
Computer Systems
URN: urn:nbn:se:kth:diva-49585DOI: 10.1145/1068009.1068186ISI: 000242040700154OAI: diva2:459844
Genetic and Evolutionary Computation Conference. Washington, DC. JUN 25-29, 2005
QC 20111201Available from: 2011-11-28 Created: 2011-11-28 Last updated: 2011-12-01Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Biehl, Matthias
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 16 hits
ReferencesLink to record
Permanent link

Direct link