4903 search results - page 6 / 981 » The Set Covering Machine |
ICALP
2001
Springer
14 years 4 days ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
SDL
2007
13 years 9 months ago
2007
Software metrics are an essential means to assess software quality. For the assessment of software quality, typically sets of complementing metrics are used since individual metric...
WAOA
2005
Springer
14 years 1 months ago
2005
Springer
In the machine cover problem we are given m machines and n jobs to be assigned (scheduled) so that the smallest load of a machine is as large as possible. A semi-online algorithm i...
COLT
1999
Springer
13 years 12 months ago
1999
Springer
—Support vector (SV) machines are linear classifiers that use the maximum margin hyperplane in a feature space defined by a kernel function. Until recently, the only bounds on th...
ESA
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Minimizing the makespan or maximizing the minimum machine load are two of the most important and fundamental parallel machine scheduling problems. In an online scenario, ...