Sciweavers

6110 search results - page 195 / 1222
» Approximate Computing
Sort
View
INFOCOM
2009
IEEE
16 years 1 months ago
Polynomial Time Approximations for Multi-Path Routing with Bandwidth and Delay Constraints
— In this paper, we study the problem of multi-path routing with bandwidth and delay constraints, which arises in applications for video delivery over bandwidth-limited networks....
Satyajayant Misra, Guoliang Xue, Dejun Yang
PE
2010
Springer
170views Optimization» more  PE 2010»
15 years 4 months ago
Approximating passage time distributions in queueing models by Bayesian expansion
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
Giuliano Casale
AAAI
2006
15 years 8 months ago
Sample-Efficient Evolutionary Function Approximation for Reinforcement Learning
Reinforcement learning problems are commonly tackled with temporal difference methods, which attempt to estimate the agent's optimal value function. In most real-world proble...
Shimon Whiteson, Peter Stone
SDM
2007
SIAM
106views Data Mining» more  SDM 2007»
15 years 8 months ago
Approximating Representations for Large Numerical Databases
The paper introduces a notion of support for realvalued functions. It is shown how to approximate supports of a large class of functions based on supports of so called polynomial ...
Szymon Jaroszewicz, Marcin Korzen
ISVC
2007
Springer
16 years 19 days ago
Image Compression Using Data-Dependent Triangulations
We present a method to speed up the computation of a high-quality data-dependent triangulation approximating an image using simulated annealing by probability distributions guided ...
Burkhard Lehner, Georg Umlauf, Bernd Hamann