1458 search results - page 36 / 292 » Practical Preference Relations for Large Data Sets |
PKDD
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. One of the key problems in model-based reinforcement learning is balancing exploration and exploitation. Another is learning and acting in large relational domains, in wh...
NIPS
2003
13 years 9 months ago
2003
A mobile robot acting in the world is faced with a large amount of sensory data and uncertainty in its action outcomes. Indeed, almost all interesting sequential decision-making d...
SDM
2003
SIAM
13 years 9 months ago
2003
SIAM
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...
SIGMOD
1999
ACM
14 years 23 days ago
1999
ACM
The database query optimizer requires the estimation of the query selectivity to find the most efficient access plan. For queries referencing multiple attributes from the same rel...
APWEB
2005
Springer
14 years 2 months ago
2005
Springer
The dramatic growth in the number and size of on-line information sources has fueled increasing research interest in the incremental subspace learning problem. In this paper, we pr...