153 search results - page 23 / 31 » Computing Approximate Solutions of the Maximum Covering Prob... |
BMCBI
2008
13 years 7 months ago
2008
Background: Protein structure comparison is a key problem in bioinformatics. There exist several methods for doing protein comparison, being the solution of the Maximum Contact Ma...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— The need to monitor real time network services has prompted service providers to use new measurement technologies, such as service-specific probes. Service-specific probes ar...
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...
DAC
2006
ACM
14 years 8 months ago
2006
ACM
Deploying multiple supply voltages (multi-Vdds) on one chip is an important technique to reduce dynamic power consumption. In this work we present an optimality study for resource...