An Efficient Algorithm for the k-Pairwise Disjoint Paths Problem in Hypercubes

By Gu Q-P.   Peng S.  

Journal of Parallel and Distributed Computing, Vol. 60, Iss. 6, 2000-06 ,pp. : 764-774

Academic Press

Access to resources Recommend Favorite

A multiple-population genetic algorithm for branch coverage test data generation

By Alshraideh Mohammad  

Software Quality Journal, Vol. 19, Iss. 3, 2011-09 ,pp. : 489-513

Springer Publishing Company

Access to resources Recommend Favorite

KNFCOM-T: a k-nearest features-based co-location pattern mining algorithm for large spatial data sets by using T-trees

By Wan You   Zhou Jiaogen  

International Journal of Business Intelligence and Data Mining, Vol. 3, Iss. 4, 2009-01 ,pp. : 375-389

Inderscience Publishers

Access to resources Recommend Favorite

Restoring coverage area for WSN through simulated annealing

By Habib Sami J.   Marimuthu Paulvanna N.  

International Journal of Pervasive Computing and Communications, Vol. 7, Iss. 3, 2011-09 ,pp. : 205-219

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Beacon moving location algorithm in WSN

By Mao Keji   Shao Qike   He Wenxiu   Chen Rong   Chen Qingzhang  

International Journal of Sensor Networks, Vol. 14, Iss. 2, 2013-09 ,pp. : 82-91

Inderscience Publishers

Access to resources Recommend Favorite