AIPS
2008
13 years 7 months ago
2008
We present an algorithm that quickly finds optimal plans for unforeseen agent preferences within graph-based planning domains where actions have deterministic outcomes and action ...
VLDB
1998
ACM
13 years 8 months ago
1998
ACM
Query optimizers normally compile queries into one optimal plan by assuming complete knowledge of all cost parameters such asselectivity and resourceavailability. The execution of...
PAAMS
2010
Springer
13 years 9 months ago
2010
Springer
In this paper, we introduce a new heuristic search algorithm based on mean values for anytime planning, called MHSP. It consists in associating the principles of UCT, a bandit-base...
ER
2004
Springer
13 years 10 months ago
2004
Springer
In this paper we present a model of functional access to data that, we argue, is suitable for modeling a class of data repositories characterized by functional access, such as web ...