Sciweavers

439 search results - page 1 / 88
» Engineering Comparators for Graph Clusterings
Sort
View
AAIM
2008
Springer
119views Algorithms» more  AAIM 2008»
13 years 10 months ago
Engineering Comparators for Graph Clusterings
A promising approach to compare two graph clusterings is based on using measurements for calculating the distance between them. Existing measures either use the structure of cluste...
Daniel Delling, Marco Gaertler, Robert Görke,...
DAC
2003
ACM
14 years 5 months ago
Partial task assignment of task graphs under heterogeneous resource constraints
This paper presents a novel partial assignment technique (PAT) that decides which tasks should be assigned to the same resource without explicitly defining assignment of these tas...
Radoslaw Szymanek, Krzysztof Kuchcinski
IWPC
2005
IEEE
13 years 10 months ago
Clustering Software Artifacts Based on Frequent Common Changes
Changes of software systems are less expensive and less error-prone if they affect only one subsystem. Thus, clusters of artifacts that are frequently changed together are subsyst...
Dirk Beyer, Andreas Noack
ISPASS
2006
IEEE
13 years 10 months ago
Comparing multinomial and k-means clustering for SimPoint
SimPoint is a technique used to pick what parts of the program’s execution to simulate in order to have a complete picture of execution. SimPoint uses data clustering algorithms...
Greg Hamerly, Erez Perelman, Brad Calder