3096 search results - page 90 / 620 » The Generalized FITC Approximation |
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
ESA
1999
Springer
14 years 1 months ago
1999
Springer
We give a polynomial approximation scheme for the problem of scheduling on uniformly related parallel machines for a large class of objective functions that depend only on the mac...
RSCTC
2000
Springer
14 years 10 days ago
2000
Springer
Abstract. We provide the unified methodology for searching for approximate decision reducts based on rough membership distributions. Presented study generalizes well known relation...
IJCAI
2003
13 years 10 months ago
2003
We present an approximate policy iteration algorithm that uses rollouts to estimate the value of each action under a given policy in a subset of states and a classifier to general...
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
We give the first constant-factor approximation algorithm for Sparsest-Cut with general demands in bounded treewidth graphs. In contrast to previous algorithms, which rely on the f...