203 search results - page 11 / 41 » Decision Tree Pruning as a Search in the State Space |
AIPS
2008
13 years 10 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...
ATVA
2007
Springer
14 years 1 months ago
2007
Springer
Fault tree analysis is a traditional and well-established technique for analyzing system design and robustness. Its purpose is to identify sets of basic events, called cut sets, wh...
AIPS
2003
13 years 9 months ago
2003
We develop a hierarchical approach to planning for partially observable Markov decision processes (POMDPs) in which a policy is represented as a hierarchical finite-state control...
ICDM
2010
IEEE
13 years 5 months ago
2010
IEEE
Traditional Markov network structure learning algorithms perform a search for globally useful features. However, these algorithms are often slow and prone to finding local optima d...
FLAIRS
2001
13 years 9 months ago
2001
We introduce a new genetic operator, Reduction, that rectifies decision trees not correct syntactically and at the same time removes the redundant sections within, while preservin...