Van Duc Cuong
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Van Duc Cuong has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Nguyen Thi Hanh
Phenikaa University
7 shared publications - Nguyen Van Son
Phenikaa University
5 shared publications - Huynh Thi Thanh Binh
Hanoi University of Science and Technology, Hanoi, Vietnam
3 shared publications - Duy-Tung Doan
Hanoi University of Science and Technology
2 shared publications - La Van Quan
School of Computing, Phenikaa University, Hanoi, Vietnam
2 shared publications - Minh Nguyen Dinh Tuan
Hanoi University of Science and Technology
2 shared publications
Latest Publications
- 2 September 2026
- Published by Springer Nature
- p. 586-597
FLUID: Flow-Latent Unified Integration via Token Distillation for Expert Specialization in Multimodal Learning
- 2 September 2026
- Published by Springer Nature
- p. 586-597
FLUID: Flow-Latent Unified Integration via Token Distillation for Expert Specialization in Multimodal Learning
- 15 August 2026
- Published by Springer Nature
- p. 81-96
MiRAGE: Misconception Detection with Retrieval-Guided Multi-stage Reasoning and Ensemble Fusion
- 15 August 2026
- Published by Springer Nature
- p. 81-96
MiRAGE: Misconception Detection with Retrieval-Guided Multi-stage Reasoning and Ensemble Fusion
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1288-1300
TestWeaver: Execution-aware, Feedback-driven Regression Testing Generation with Large Language Models
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1288-1300
Open AccessTestWeaver: Execution-aware, Feedback-driven Regression Testing Generation with Large Language Models
- 21 February 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 339
ALSB : A problem-aware hybrid optimization framework for k-Coverage and k-connectivity in wireless sensor networks
- 21 February 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 339
ALSB : A problem-aware hybrid optimization framework for k-Coverage and k-connectivity in wireless sensor networks
- 14 August 2025
- Published by Springer Nature in Neural Computing and Applications
- Vol. 37 (26) , 21659-21694
LSHADE-NGS: enhancing Q-coverage in directional sensor networks through navigated generation search
- 14 August 2025
- Published by Springer Nature in Neural Computing and Applications
- Vol. 37 (26) , 21659-21694
LSHADE-NGS: enhancing Q-coverage in directional sensor networks through navigated generation search
- 28 April 2025
- Published by Springer Nature
- p. 297-307
H-LSHADE: An Efficient Hybrid Approach for Solving Heterogeneous Target Coverage in Visual Sensor Networks
- 28 April 2025
- Published by Springer Nature
- p. 297-307
H-LSHADE: An Efficient Hybrid Approach for Solving Heterogeneous Target Coverage in Visual Sensor Networks
- Open Access
- 10 March 2025
- Published by Slovenian Association Informatika in Informatica
- Vol. 49 (1)
Memetic Algorithm for maximizing K-coverage and K-connectivity in Wireless Sensors Network
The rapid growth of IoT has enabled diverse applications using Wireless Sensor Networks across various fields. A significant challenge in Wireless Sensor Networks is the efficient deployment of sensors to ensure coverage and connectivity. Effective coverage allows continuous target tracking and data collection, while connectivity ensures data transmission to the base station. In this paper, we address the challenge of maximizing the number of targets satisfying K-coverage and K-connectivity, where each target is tracked by K sensors and has K transmission paths to the base station. We propose a two-phase methodology to tackle this challenge. The first phase enhances the Greedy algorithm to solve the K-coverage problem. The second phase addresses the K-connectivity problem using Memetic algorithms augmented by an efficient local search mechanism called PMA. We evaluate the algorithm on various datasets and compare it with baseline methods, including Greedy and Prim-based with the withdrawal strategy (PWS). Our results show that the proposed PMA with a robust local search outperforms alternative algorithms, with improvements exceeding 10% to 15% compared to the baseline methods. Additionally, we validate the performance of the proposed method using a real-world dataset and outline plans for further enhancements in the near future.
- 10 March 2025
- Published by Slovenian Association Informatika in Informatica
- Vol. 49 (1)
Open AccessMemetic Algorithm for maximizing K-coverage and K-connectivity in Wireless Sensors Network
The rapid growth of IoT has enabled diverse applications using Wireless Sensor Networks across various fields. A significant challenge in Wireless Sensor Networks is the efficient deployment of sensors to ensure coverage and connectivity. Effective coverage allows continuous target tracking and data collection, while connectivity ensures data transmission to the base station. In this paper, we address the challenge of maximizing the number of targets satisfying K-coverage and K-connectivity, where each target is tracked by K sensors and has K transmission paths to the base station. We propose a two-phase methodology to tackle this challenge. The first phase enhances the Greedy algorithm to solve the K-coverage problem. The second phase addresses the K-connectivity problem using Memetic algorithms augmented by an efficient local search mechanism called PMA. We evaluate the algorithm on various datasets and compare it with baseline methods, including Greedy and Prim-based with the withdrawal strategy (PWS). Our results show that the proposed PMA with a robust local search outperforms alternative algorithms, with improvements exceeding 10% to 15% compared to the baseline methods. Additionally, we validate the performance of the proposed method using a real-world dataset and outline plans for further enhancements in the near future.
- Open Access
- 14 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 17-18
Alimentation Deep Multiple Optimal Ant Colony Optimization to solve Vehicle Routing Problem with Time Windows
Recently, there has been a noticeable increase in the adoption of deep learning techniques to tackle time window routing issues, which are prevalent in various real-world applications. Our paper introduces Alimentation Deep Multiple Optimal Ant Colony Optimization (AMO-ACO), a new neural-enhanced method for solving the Vehicle Routing Problem with Time Windows. Our model handles the problem as a multi-objective task, using transfer learning across constraints and exploring various paths for the ant colony from starting points.
- 14 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 17-18
Open AccessAlimentation Deep Multiple Optimal Ant Colony Optimization to solve Vehicle Routing Problem with Time Windows
Recently, there has been a noticeable increase in the adoption of deep learning techniques to tackle time window routing issues, which are prevalent in various real-world applications. Our paper introduces Alimentation Deep Multiple Optimal Ant Colony Optimization (AMO-ACO), a new neural-enhanced method for solving the Vehicle Routing Problem with Time Windows. Our model handles the problem as a multi-objective task, using transfer learning across constraints and exploring various paths for the ant colony from starting points.