40 search results - page 4 / 8 » On Conditional Branches in Optimal Decision Trees |
110
click to vote
KDD
2007
ACM
15 years 10 months ago
2007
ACM
Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...
EVOW
2010
Springer
15 years 4 months ago
2010
Springer
We propose a novel distance based method for phylogenetic tree reconstruction. Our method is based on a conceptual clustering method that extends the well-known decision tree learn...
JSA
2006
14 years 9 months ago
2006
It is often possible to greatly improve the performance of a hardware system via the use of predictive (speculative) techniques. For example, the performance of out-of-order micro...
52
Voted
AAAI
2004
14 years 11 months ago
2004
Performance profile trees have recently been proposed as a theoretical basis for fully normative deliberation control. In this paper we conduct the first experimental study of the...
AIPS
1996
14 years 11 months ago
1996
The principle of least commitment was embraced early in planning research. Hierarchical task networks (HTNs)reason about high-level tasks without committing to specific low-level ...