1518 search results - page 53 / 304 » Exact and Approximate Bandwidth |
ICML
1995
IEEE
15 years 10 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...
CP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...
ISAAC
2005
Springer
15 years 3 months ago
2005
Springer
We develop exact and approximate algorithms for computing optimal separators and measuring the extent to which two point sets in d-dimensional space are separated, with respect to...
FGCS
2006
14 years 9 months ago
2006
Recent results on the local and global properties of multisymplectic discretizations of Hamiltonian PDEs are discussed. We consider multisymplectic (MS) schemes based on Fourier s...
FSTTCS
2003
Springer
15 years 2 months ago
2003
Springer
Given a polygonal path P with vertices p1, p2, . . . , pn and a real number t ≥ 1, a path Q = (pi1 , pi2 , . . . , pik ) is a t-distance-preserving approximation of P if 1 = i1 &...