Sciweavers

3244 search results - page 264 / 649
» On convex complexity measures
Sort
View
IMSCCS
2006
IEEE
16 years 20 days ago
A New Scheduling Algorithm for Servers
Slowdown is used to measure the fairness degree of a scheduling algorithm in existing work. However, the fairness degree should be considered within a scheduling algorithm; rather...
Nianmin Yao, Wenbin Yao, Shaobin Cai, Jun Ni
ICMCS
2005
IEEE
126views Multimedia» more  ICMCS 2005»
16 years 7 days ago
A HMM-Embedded Unsupervised Learning to Musical Event Detection
In this paper, an HMM-embedded unsupervised learning approach is proposed to detect the music events by grouping the similar segments of the music signal. This approach can cluste...
Sheng Gao, Yongwei Zhu
VISSOFT
2005
IEEE
16 years 6 days ago
The Dominance Tree in Visualizing Software Dependencies
Dominance analysis from graph theory allows one to locate subordinated software elements in a rooted dependency graph. It identifies the nesting structure for a dependency graph ...
Raimar Falke, Raimund Klein, Rainer Koschke, Joche...
MSR
2005
ACM
16 years 6 days ago
When do changes induce fixes?
As a software system evolves, programmers make changes that sometimes cause problems. We analyze CVS archives for fix-inducing changes—changes that lead to problems, indicated ...
Jacek Sliwerski, Thomas Zimmermann, Andreas Zeller
GECCO
2005
Springer
129views Optimization» more  GECCO 2005»
16 years 4 days ago
Post-processing clustering to reduce XCS variability
XCS is a stochastic algorithm, so it does not guarantee to produce the same results when run with the same input. When interpretability matters, obtaining a single, stable result ...
Flavio Baronti, Alessandro Passaro, Antonina Stari...