Lower Bounds for Dynamic Tree Embedding in Bipartite Networks

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

Journal of Parallel and Distributed Computing, Vol. 53, Iss. 2, 1998-09 ,pp. : 119-143

Academic Press

Access to resources Recommend Favorite

A simple performance analysis of RFID networks with binary tree collision arbitration

By Ferrari Gianluigi   Cappelletti Fabio   Raheli Riccardo  

International Journal of Sensor Networks, Vol. 4, Iss. 3, 2008-12 ,pp. : 194-208

Inderscience Publishers

Access to resources Recommend Favorite

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

By Li Keqin  

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

Springer Publishing Company

Access to resources Recommend Favorite

Incremental K-clique clustering in dynamic social networks

By Duan Dongsheng  

Artificial Intelligence Review, Vol. 38, Iss. 2, 2012-08 ,pp. : 129-147

Springer Publishing Company

Access to resources Recommend Favorite

Analysis of random sleep scheme for wireless sensor networks

By Liu Jianming   Jiang Xiaohong   Horiguchi Susumu   Lee Tony-Tong  

International Journal of Sensor Networks, Vol. 7, Iss. 1-2, 2010-02 ,pp. : 71-84

Inderscience Publishers

Access to resources Recommend Favorite