Sciweavers

30 search results - page 3 / 6
» The Reverse Greedy Algorithm for the Metric K-Median Problem
Sort
View
WCRE
1999
IEEE
13 years 8 months ago
MoJo: A Distance Metric for Software Clusterings
The software clustering problem has attracted much attention recently, since it is an integral part of the process of reverse engineering large software systems. A key problem in ...
Vassilios Tzerpos, Richard C. Holt
STACS
2005
Springer
13 years 10 months ago
Cycle Cover with Short Cycles
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...
Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirro...
CORR
2010
Springer
186views Education» more  CORR 2010»
12 years 11 months ago
QoS Routing in Smart Grid
Smart grid is an emerging technology which is able to control the power load via price signaling. The communication between the power supplier and power customers is a key issue in...
Husheng Li, Weiyi Zhang
GECCO
2005
Springer
115views Optimization» more  GECCO 2005»
13 years 10 months ago
Search-based improvement of subsystem decompositions
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 t...
Olaf Seng, Markus Bauer, Matthias Biehl, Gert Pach...
TASE
2010
IEEE
12 years 11 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen