Sciweavers

811 search results - page 55 / 163
» Avoiding Approximate Squares
Sort
View
IWANN
1999
Springer
13 years 12 months ago
Using Temporal Neighborhoods to Adapt Function Approximators in Reinforcement Learning
To avoid the curse of dimensionality, function approximators are used in reinforcement learning to learn value functions for individual states. In order to make better use of comp...
R. Matthew Kretchmar, Charles W. Anderson
ENTCS
2007
153views more  ENTCS 2007»
13 years 7 months ago
The Methods of Approximation and Lifting in Real Computation
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...
Manuel Lameiras Campagnolo, Kerry Ojakian
ICC
2007
IEEE
132views Communications» more  ICC 2007»
14 years 1 months ago
Topology Reconstruction and Characterisation of Wireless Ad Hoc Networks
Abstract— Wireless ad hoc networks provide a useful communications infrastructure for the mobile battlefield. In this paper we apply and develop passive radio frequency signal s...
Jon Arnold, Nigel Bean, Miro Kraetzl, Matthew Roug...
ICML
2009
IEEE
14 years 8 months ago
Analytic moment-based Gaussian process filtering
We propose an analytic moment-based filter for nonlinear stochastic dynamic systems modeled by Gaussian processes. Exact expressions for the expected value and the covariance matr...
Marc Peter Deisenroth, Marco F. Huber, Uwe D. Hane...
WG
2007
Springer
14 years 1 months ago
The Complexity of Bottleneck Labeled Graph Problems
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
Refael Hassin, Jérôme Monnot, Danny S...