Sciweavers

2407 search results - page 9 / 482
» The evolutionary forest algorithm
Sort
View
ECCC
2007
59views more  ECCC 2007»
14 years 9 months ago
Improved approximation algorithms for directed Steiner forest
Sharon Feldman, Guy Kortsarz, Zeev Nutov
MST
2007
89views more  MST 2007»
14 years 9 months ago
A Faster FPT Algorithm for the Maximum Agreement Forest Problem
Michael T. Hallett, Catherine McCartin
COCOA
2008
Springer
14 years 11 months ago
Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
Shai Gutner
IDA
2007
Springer
15 years 3 months ago
Combining Bagging and Random Subspaces to Create Better Ensembles
Random forests are one of the best performing methods for constructing ensembles. They derive their strength from two aspects: using random subsamples of the training data (as in b...
Pance Panov, Saso Dzeroski