Sciweavers

3038 search results - page 27 / 608
» High-Speed Function Approximation
Sort
View
ESANN
2007
14 years 11 months ago
Replacing eligibility trace for action-value learning with function approximation
The eligibility trace is one of the most used mechanisms to speed up reinforcement learning. Earlier reported experiments seem to indicate that replacing eligibility traces would p...
Kary Främling
ATAL
2005
Springer
15 years 3 months ago
Improving reinforcement learning function approximators via neuroevolution
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...
Shimon Whiteson
ICASSP
2009
IEEE
15 years 4 months ago
Multichannel speech enhancement using convolutive transfer function approximation in reverberant environments
Recently, we have presented a transfer-function generalized sidelobe canceler (TF-GSC) beamformer in the short time Fourier transform domain, which relies on a convolutive transfe...
Ronen Talmon, Israel Cohen, Sharon Gannot
ICDE
1998
IEEE
108views Database» more  ICDE 1998»
15 years 11 months ago
Efficient Discovery of Functional and Approximate Dependencies Using Partitions
Discovery of functionaldependencies from relations has been identified as an important database analysis technique. In this paper, we present a new approach for finding functional...
Ykä Huhtala, Juha Kärkkäinen, Pasi ...
DSD
2007
IEEE
116views Hardware» more  DSD 2007»
15 years 4 months ago
Design Method for Numerical Function Generators Based on Polynomial Approximation for FPGA Implementation
This paper focuses on numerical function generators (NFGs) based on k-th order polynomial approximations. We show that increasing the polynomial order k reduces significantly the...
Shinobu Nagayama, Tsutomu Sasao, Jon T. Butler