163 search results - page 6 / 33 » Tight Approximability Results for Test Set Problems in Bioin... |
WADS
2005
Springer
14 years 29 days ago
2005
Springer
Abstract. We give processor-allocation algorithms for grid architectures, where the objective is to select processors from a set of available processors to minimize the average num...
MFCS
2009
Springer
14 years 1 days ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
NETWORKS
2010
13 years 5 months ago
2010
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...
DAM
2008
13 years 7 months ago
2008
We investigate the Semidefinite Programming based Sums of squares (SOS) decomposition method, designed for global optimization of polynomials, in the context of the (Maximum) Sati...
WWW
2005
ACM
14 years 8 months ago
2005
ACM
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...