4894 search results - page 233 / 979 » The Guarding Problem - Complexity and Approximation |
145
click to vote
JAIR
2011
15 years 1 months ago
2011
This paper describes a computationally feasible approximation to the AIXI agent, a universal reinforcement learning agent for arbitrary environments. AIXI is scaled down in two ke...
211
click to vote
PODS
2004
ACM
16 years 6 months ago
2004
ACM
Geometric coordinates are an integral part of many data streams. Examples include sensor locations in environmental monitoring, vehicle locations in traffic monitoring or battlefi...
160
click to vote
ISMVL
2009
IEEE
16 years 1 months ago
2009
IEEE
Using concepts from rough set theory we investigate the existence of approximative descriptions of collections of objects that can be extracted from data sets, a problem of intere...
172
click to vote
ICRA
2005
IEEE
16 years 4 days ago
2005
IEEE
— For the Simultaneous Localization and Mapping problem several efficient algorithms have been proposed that make use of a sparse information matrix representation (e.g. SEIF, T...
184
click to vote
ICCBR
2005
Springer
16 years 2 days ago
2005
Springer
CBR is one of the techniques that can be applied to the task of approximating a function over high-dimensional, continuous spaces. In Reinforcement Learning systems a learning agen...