7150 search results - page 82 / 1430 » An Approximation Algorithm for Approximation Rank |
85
Voted
CIAC
2006
Springer
15 years 4 months ago
2006
Springer
Consider a truck running along a road. It picks up a load Li at point i and delivers it at i, carrying at most one load at a time. The speed on the various parts of the road in on...
100
click to vote
EUROPAR
2010
Springer
15 years 24 days ago
2010
Springer
We present in this article a new approximation algorithm for scheduling a set of n independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel ...
122
click to vote
JCSS
2002
15 years 8 days ago
2002
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
103
Voted
IJAR
2010
14 years 11 months ago
2010
Credal nets generalize Bayesian nets by relaxing the requirement of precision of probabilities. Credal nets are considerably more expressive than Bayesian nets, but this makes bel...
131
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can ...