1013 search results - page 121 / 203 » A Subexponential Algorithm for Abstract Optimization Problem... |
INFORMATICALT
2002
14 years 9 months ago
2002
Abstract. Real life scheduling problems are solved by heuristics with parameters defined by experts, as usual. In this paper a new approach is proposed where the parameters of vari...
ESA
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
JSAC
2008
14 years 9 months ago
2008
Abstract--Optimal tone allocation in downlink OFDMA networks is a non-convex NP-hard problem that requires extensive feedback for channel information. In this paper, two constantco...
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We consider the clustering with diversity problem: given a set of colored points in a metric space, partition them into clusters such that each cluster has at least point...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Abstract. We define a novel, basic, unsupervised learning problem learning the the lowest density homogeneous hyperplane separator of an unknown probability distribution. This task...