An efficient GPU multiple-observer siting method based on sparse-matrix multiplication
暂无分享,去创建一个
Wenli Li | Salles V. G. Magalhães | Marcus Vinícius Alvim Andrade | W. Randolph Franklin | Guilherme C. Pena | Cháulio R. Ferreira | M. Andrade | Wenli Li | S. V. G. Magalhães | C. Ferreira
[1] Michael Segal,et al. Automated antenna positioning algorithms for wireless fixed-access networks , 2007, J. Heuristics.
[2] John R. Gilbert,et al. Solving path problems on the GPU , 2010, Parallel Comput..
[3] Qing Zhu,et al. Digital terrain modeling - principles and methodology , 2004 .
[4] Thomas A. Hennig,et al. The Shuttle Radar Topography Mission , 2001, Digital Earth Moving.
[5] Barbara Cutler,et al. Efficient viewshed computation on terrains in external memory , 2008 .
[6] George Nagy,et al. Terrain visibility , 1994, Comput. Graph..
[7] Salles V. G. Magalhães,et al. An optimization heuristic for siting observers in huge terrains stored in external memory , 2010, 2010 10th International Conference on Hybrid Intelligent Systems.
[8] Salles V. G. Magalhães,et al. An Improved Parallel Algorithm Using GPU for Siting Observers on Terrain , 2014, ICEIS.
[9] Francisco Vázquez,et al. FastSpMM: An Efficient Library for Sparse Matrix Matrix Product on GPUs , 2014, Comput. J..
[10] W. R. Franklin. Siting Observers on Terrain , 2002 .
[11] Jack J. Purdum,et al. C programming guide , 1983 .
[12] W. Randolph Franklin. Higher isn ’ t Necessarily Better : Visibility Algorithms and Experiments , 1994 .