( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Heuristic algorithm for target coverage with connectivity fault-tolerance problem in wireless sensor networks.

, , , и . TAAI, стр. 235-240. IEEE, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Nguyen Duc Nghia

Hoang-Duc-Nghia

Duc-Dang Nghia

Nghia Duc Dang

Nguyen Nghia Binh

 

Другие публикации лиц с тем же именем

An experimental study of minimum routing cost spanning tree algorithms., и . SoCPaR, стр. 158-165. IEEE, (2013)An approach of ant algorithm for solving minimum routing cost spanning tree problem., , и . SoICT, стр. 5-10. ACM, (2011)A parallel algorithm combines genetic algorithm and ant colony algorithm for the minimum latency problem., и . SoICT, стр. 39-48. ACM, (2014)Improved genetic algorithm for minimum latency problem., и . SoICT, том 449 из ACM International Conference Proceeding Series, стр. 9-15. ACM, (2010)Solving graphical Steiner tree problem using parallel genetic algorithm., и . RIVF, стр. 29-35. IEEE, (2008)Simulated Annealing for the Assembly Line Balancing Problem in the Garment Industry., , , , , и . SoICT, стр. 36-42. ACM, (2019)Metaheuristics for maximization of obstacles constrained area coverage in heterogeneous wireless sensor networks., , , , и . Appl. Soft Comput., (2020)Heuristic algorithm for target coverage with connectivity fault-tolerance problem in wireless sensor networks., , , и . TAAI, стр. 235-240. IEEE, (2016)An Experimental Study about Efficiency of the Approximation Algorithms for Minimum Latency Problem., и . RIVF, стр. 1-4. IEEE, (2012)A meta-heuristic algorithm combining between Tabu and Variable Neighborhood Search for the Minimum Latency Problem., и . RIVF, стр. 192-197. IEEE, (2013)