|
|
Hybridizing evolutionary algorithms and clustering algorithms to find source-code clones |
 |
 |
 |
|
Written by Administrator
|
|
Thursday, 11 September 2008 12:40 |
|
Title: Hybridizing evolutionary algorithms and clustering algorithms to find source-code clones Authors:Sutton, A; Kagdi, H; Maletic, JI; Volkert, LG Source:GECCO 2005: GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, VOLS 1AND 2 Pages: 1079-1080 Published: 2005 Abstract: This paper presents a hybrid approach to detect source-code clones that combines evolutionary algorithms and clustering. A case-study is conducted on a small C++ code base. The preliminary investigation indicates that such an approach is effective in detecting groups of source-code clones. DOI: http://doi.acm.org/10.1145/1068009.1068191 |
|
|
Search-based improvement of subsystem decompositions |
|
|
|
|
Written by Administrator
|
|
Thursday, 11 September 2008 12:37 |
|
Title: Search-based improvement of subsystem decompositions Authors:Seng, O; Bauer, M; Biehl, M; Pache, G Source: GECCO 2005: GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, VOLS 1AND 2 Pages: 1045-1051 Published: 2005 Abstract: 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. DOI: http://doi.acm.org/10.1145/1068009.1068186 |
|
Last Updated on Thursday, 11 September 2008 12:39 |
|
|
|
|
|
|
