1068 search results - page 115 / 214 » Extremely randomized trees |
ESA
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
BMCBI
2006
13 years 10 months ago
2006
Background: With current technology, vast amounts of data can be cheaply and efficiently produced in association studies, and to prevent data analysis to become the bottleneck of ...
FSTTCS
1995
Springer
14 years 1 months ago
1995
Springer
Karp and Zhang developed a general randomized parallel algorithm for solving branch and bound problems. They showed that with high probability their algorithm attained optimal spe...
BMCBI
2006
13 years 10 months ago
2006
Background: The neighbor-joining method by Saitou and Nei is a widely used method for constructing phylogenetic trees. The formulation of the method gives rise to a canonical (n3)...
ICNP
2003
IEEE
14 years 3 months ago
2003
IEEE
Practical crossbar scheduling algorithms for CIOQ switches such as PIM and ¢ -SLIP, can perform poorly under extreme traffic conditions, frequently failing to be workconserving....