7129 search results - page 264 / 1426 » Approximation Algorithms for Treewidth |
186
click to vote
DAGSTUHL
1997
15 years 5 months ago
1997
There is a wide range of applications for which surface interpolation or approximation from scattered data points in space is important. Dependent on the field of application and...
126
click to vote
ESA
2010
Springer
15 years 5 months ago
2010
Springer
We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an -approximat...
143
click to vote
TC
2011
14 years 11 months ago
2011
Abstract—The fused multiply accumulate-add (FMA) instruction, specified by the IEEE 754-2008 Standard for Floating-Point Arithmetic, eases some calculations, and is already avai...
151
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
150
click to vote
ICML
2001
IEEE
16 years 5 months ago
2001
IEEE
We introduce the first algorithm for off-policy temporal-difference learning that is stable with linear function approximation. Off-policy learning is of interest because it forms...