Sciweavers

2034 search results - page 263 / 407
» On the Comparability of Software Clustering Algorithms
Sort
View
ENDM
2010
84views more  ENDM 2010»
13 years 9 months ago
Formulation symmetries in circle packing
The performance of Branch-and-Bound algorithms is severely impaired by the presence of symmetric optima in a given problem. We describe a method for the automatic detection of for...
Alberto Costa, Leo Liberti, Pierre Hansen
IDA
2008
Springer
13 years 9 months ago
Transcription factor binding site recognition by regularity matrices based on the natural classification method
A principally new approach to the classifications of nucleotide sequences based on the "natural" classification concept is proposed. As a result of "natural" c...
Eugenii E. Vityaev, K. A. Lapardin, I. V. Khomiche...
SIGSOFT
2008
ACM
14 years 10 months ago
Automatically locating framework extension examples
Using and extending a framework is a challenging task whose difficulty is exacerbated by the poor documentation that generally comes with the framework. Even in the presence of do...
Barthélémy Dagenais, Harold Ossher
KBSE
2007
IEEE
14 years 3 months ago
Feature location via information retrieval based filtering of a single scenario execution trace
The paper presents a semi-automated technique for feature location in source code. The technique is based on combining information from two different sources: an execution trace, ...
Dapeng Liu, Andrian Marcus, Denys Poshyvanyk, Vacl...
KBSE
2007
IEEE
14 years 3 months ago
Combined static and dynamic mutability analysis
Knowing which method parameters may be mutated during a method’s execution is useful for many software engineering tasks. We present an approach to discovering parameter referen...
Shay Artzi, Adam Kiezun, David Glasser, Michael D....