12519 search results - page 12 / 2504 » Approximation Problems Categories |
121
click to vote
ATAL
2005
Springer
15 years 5 months ago
2005
Springer
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
113
click to vote
COMPGEOM
2011
ACM
14 years 3 months ago
2011
ACM
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
ISSAC
2009
Springer
15 years 6 months ago
2009
Springer
We present an iterative algorithm for calculating approximate greatest common divisor (GCD) of univariate polynomials with the real coefficients. For a given pair of polynomials a...
106
click to vote
IPSN
2009
Springer
15 years 6 months ago
2009
Springer
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
110
click to vote
GECCO
2008
Springer
15 years 23 days ago
2008
Springer
Pair approximations have often been used to predict equilibrium conditions in spatially-explicit epidemiological and ecological systems. In this work, we investigate whether this ...