599 search results - page 21 / 120 » The repeater tree construction problem |
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees. ...
AUSAI
1999
Springer
15 years 1 months ago
1999
Springer
Model trees—decision trees with linear models at the leaf nodes—have recently emerged as an accurate method for numeric prediction that produces understandable models. However,...
89
Voted
ICML
2003
IEEE
15 years 10 months ago
2003
IEEE
This paper explores the problem of how to construct lazy decision tree ensembles. We present and empirically evaluate a relevancebased boosting-style algorithm that builds a lazy ...
79
Voted
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...
VLSID
2002
IEEE
15 years 10 months ago
2002
IEEE
In this paper, we propose a hierarchical timing-driven Steiner tree algorithm for global routing which considers the minimization of timing delay during the tree construction as t...