613 search results - page 5 / 123 » The Model-Summary Problem and a Solution for Trees |
EOR
2000
13 years 6 months ago
2000
In the capacitated arc routing problem with multiple centers (M-CARP) the objective is to
KDD
1998
ACM
13 years 11 months ago
1998
ACM
This paper explores unexpected results that lie at the intersection of two common themes in the KDD community: large datasets and the goal of building compact models. Experiments ...
AUSAI
1998
Springer
13 years 11 months ago
1998
Springer
Decision tree grafting adds nodes to inferred decision trees. Previous research has demonstrated that appropriate grafting techniques can improve predictive accuracy across a wide ...
ICPADS
2007
IEEE
14 years 1 months ago
2007
IEEE
Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes...
COR
2007
13 years 6 months ago
2007
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...