10 search results - page 1 / 2 » Scaling up Heuristic Planning with Relational Decision Trees |
JAIR
2011
12 years 11 months ago
2011
Current evaluation functions for heuristic planning are expensive to compute. In numerous planning problems these functions provide good guidance to the solution, so they are wort...
AIPS
2008
13 years 6 months ago
2008
The current evaluation functions for heuristic planning are expensive to compute. In numerous domains these functions give good guidance on the solution, so it worths the computat...
DATAMINE
1999
13 years 4 months ago
1999
Abstract. One of the de ning challenges for the KDD research community is to enable inductive learning algorithms to mine very large databases. This paper summarizes, categorizes, ...
CORR
2000
Springer
13 years 4 months ago
2000
Springer
When comparing inductive logic programming (ILP) and attribute-value learning techniques, there is a trade-off between expressive power and efficiency. Inductive logic programming ...
AIPS
2007
13 years 6 months ago
2007
In sequential decision-making problems formulated as Markov decision processes, state-value function approximation using domain features is a critical technique for scaling up the...