666 search results - page 75 / 134 » New primal-dual algorithms for Steiner tree problems |
ML
2006
ACM
13 years 9 months ago
2006
ACM
Abstract This paper proposes a new tree-based ensemble method for supervised classification and regression problems. It essentially consists of randomizing strongly both attribute ...
ISCAPDCS
2003
13 years 10 months ago
2003
The quick construction of the Shortest Path Tree (SPT) is essential to achieve fast routing speed for an interior network using link state protocols, such as OSPF and IS-IS. Whene...
PCI
2005
Springer
14 years 2 months ago
2005
Springer
The increasing popularity of all-optical networks has led to extensive research on the routing and wavelength assignment problem, also termed as the Routing and Path Coloring probl...
STACS
2004
Springer
14 years 2 months ago
2004
Springer
OrthogonalVariableSpreadingFactor(OVSF)codesareusedinUMTStosharetheradiospectrum among several connections of possibly different bandwidth requirements. The combinatorial core of t...
ICRA
2009
IEEE
14 years 3 months ago
2009
IEEE
— Rapidly-exploring Random Trees (RRTs) are widely used to solve large planning problems where the scope prohibits the feasibility of deterministic solvers, but the efficiency o...