7930 search results - page 283 / 1586 » Greedy in Approximation Algorithms |
159
click to vote
CAGD
2006
15 years 6 months ago
2006
We suggest a local hybrid approximation scheme based on polynomials and radial basis functions, and use it to modify the scattered data fitting algorithm of [7]. Similar to that a...
180
click to vote
STOC
1996
ACM
15 years 10 months ago
1996
ACM
We consider the problem of scheduling n jobs that are released over time on a single machine in order to minimize the total ow time. This problem is well-known to be NPcomplete, a...
166
click to vote
APPROX
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. We consider the problem of fitting an n × n distance matrix M by a tree metric T. We give a factor O(min{n1/p , (k log n)1/p }) approximation algorithm for finding the...
154
click to vote
FUZZIEEE
2007
IEEE
16 years 28 days ago
2007
IEEE
— Reinforcement learning (RL) is a learning control paradigm that provides well-understood algorithms with good convergence and consistency properties. Unfortunately, these algor...
184
click to vote
ICDE
2010
IEEE
16 years 6 months ago
2010
IEEE
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...