Nguyen Duc Nghia

According to our database1, Nguyen Duc Nghia authored at least 18 papers between 2007 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Metaheuristics for maximization of obstacles constrained area coverage in heterogeneous wireless sensor networks.
Appl. Soft Comput., 2020

2019
Efficient approximation approaches to minimal exposure path problem in probabilistic coverage model for wireless sensor networks.
Appl. Soft Comput., 2019

Metaheuristic for the Traveling Repairman Problem with Time Window Constraints.
Proceedings of the 2019 IEEE-RIVF International Conference on Computing and Communication Technologies, 2019

2017
A Meta-Heuristic Algorithm Combining Between Tabu and Variable Neighborhood Search for the Minimum Latency Problem.
Fundam. Informaticae, 2017

Genetic algorithm for solving minimal exposure path in mobile sensor networks.
Proceedings of the 2017 IEEE Symposium Series on Computational Intelligence, 2017

An Adaptive Large Neighborhood Search for Multi-trip Multi-traffic Pickup and Delivery problem with Time Windows and Synchronization.
Proceedings of the Eighth International Symposium on Information and Communication Technology, 2017

2016
Heuristic algorithm for target coverage with connectivity fault-tolerance problem in wireless sensor networks.
Proceedings of the Conference on Technologies and Applications of Artificial Intelligence, 2016

2015
An Improved Genetic Algorithm for Maximizing Area Coverage in Wireless Sensor Networks.
Proceedings of the Sixth International Symposium on Information and Communication Technology, 2015

2014
A parallel algorithm combines genetic algorithm and ant colony algorithm for the minimum latency problem.
Proceedings of the Fifth Symposium on Information and Communication Technology, 2014

2013
An experimental study of minimum routing cost spanning tree algorithms.
Proceedings of the 2013 International Conference on Soft Computing and Pattern Recognition, 2013

A Subgradient Method to Improve Approximation Ratio in the Minimum Latency Problem.
Proceedings of the Knowledge and Systems Engineering, 2013

2012
An Experimental Study about Efficiency of the Approximation Algorithms for Minimum Latency Problem.
Proceedings of the 2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future (RIVF), Ho Chi Minh City, Vietnam, February 27, 2012

2011
An approach of ant algorithm for solving minimum routing cost spanning tree problem.
Proceedings of the 2011 Symposium on Information and Communication Technology, 2011

2010
Improved genetic algorithm for minimum latency problem.
Proceedings of the 2010 Symposium on Information and Communication Technology, 2010

2009
New heuristic and hybrid genetic algorithm for solving the bounded diameter minimum spanning tree problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2009

New Multi-parent Recombination in Genetic Algorithm for Solving Bounded Diameter Minimum Spanning Tree Problem.
Proceedings of the First Asian Conference on Intelligent Information and Database Systems, 2009

2008
Solving graphical Steiner tree problem using parallel genetic algorithm.
Proceedings of the 2008 IEEE International Conference on Research, 2008

2007
New Recombination Operator in Genetic Algorithm For Solving the Bounded Diameter Minimum Spanning Tree Problem.
Proceedings of the 2007 IEEE International Conference on Research, 2007


  Loading...