592 search results - page 5 / 119 » Learning Generalized Plans Using Abstract Counting |
OOPSLA
2005
Springer
14 years 1 months ago
2005
Springer
Currently, the most adopted criterion to invoke garbage collection is heap space exhaustion. In other words, garbage collection is invoked when the heap space (either the entire s...
SIGMOD
2001
ACM
14 years 8 months ago
2001
ACM
We study the problem of generating e cient, equivalent rewritings using views to compute the answer to a query. We take the closed-world assumption, in which views are materialize...
FLAIRS
2009
13 years 6 months ago
2009
In this paper, we investigate the hypothesis that plan recognition can significantly improve the performance of a casebased reinforcement learner in an adversarial action selectio...
LAMAS
2005
Springer
14 years 1 months ago
2005
Springer
In this paper we report on using a relational state space in multi-agent reinforcement learning. There is growing evidence in the Reinforcement Learning research community that a r...
AIPS
2006
13 years 9 months ago
2006
We view dynamic scheduling as a sequential decision problem. Firstly, we introduce a generalized planning operator, the stochastic task model (STM), which predicts the effects of ...