On the Performance of Randomized Embedding of Reproduction Trees in Static Networks

ISSN： 0885-7458

Source： International Journal of Parallel Programming, Vol.31, Iss.5, 2003-10, pp. : 393-406

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Dense edge-disjoint embedding of complete binary trees in interconnection networks

By Ravindran S. Gibbons A.M. Paterson M.S.

Theoretical Computer Science, Vol. 249, Iss. 2, 2000-10 ,pp. : 325-342

Elsevier

Access to resources Recommend Favorite

Performance Analysis for Dynamic Tree Embedding in k-Partite Networks by a Random Walk

By Shen H. Li K. Pan Y. Young G.H. Zheng S.Q.

Journal of Parallel and Distributed Computing, Vol. 50, Iss. 1, 1998-01 ,pp. : 144-156

Academic Press

Access to resources Recommend Favorite

Extremely randomized trees

By Geurts Pierre

Machine Learning, Vol. 63, Iss. 1, 2006-04 ,pp. : 3-42

Springer Publishing Company

Access to resources Recommend Favorite

Embedding of Binomial Trees in Hypercubes with Link Faults

By Wu J. Fernandez E.B. Luo Y.

Journal of Parallel and Distributed Computing, Vol. 54, Iss. 1, 1998-10 ,pp. : 59-74

Academic Press

Access to resources Recommend Favorite

Optimal Embedding of Complete Binary Trees into Lines and Grid

By Heckmann R. Klasing R. Monien B. Unger W.

Journal of Parallel and Distributed Computing, Vol. 49, Iss. 1, 1998-02 ,pp. : 40-56

Academic Press

Access to resources Recommend Favorite