7150 search results - page 267 / 1430 » An Approximation Algorithm for Approximation Rank |
169
click to vote
ICML
1995
IEEE
16 years 7 months ago
1995
IEEE
The success ofreinforcement learninginpractical problems depends on the ability to combine function approximation with temporal di erence methods such as value iteration. Experime...
217
click to vote
PDCAT
2005
Springer
16 years 4 days ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
172
click to vote
WEA
2005
Springer
16 years 3 days ago
2005
Springer
The vertex cover problem is a classic NP-complete problem for which the best worst-case approximation ratio is roughly 2. In this paper, we use a collection of simple reductions, e...
197
click to vote
ICANN
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Trained support vector machines (SVMs) have a slow runtime classification speed if the classification problem is noisy and the sample data set is large. Approximating the...
151
click to vote
CAD
2008
Springer
15 years 6 months ago
2008
Springer
Curves on surfaces play an important role in computer-aided geometric design. Because of the considerably high degree of exact curves on surfaces, approximation algorithms are pre...