Dangdang Niu

Orcid: 0000-0003-1576-1657

According to our database1, Dangdang Niu authored at least 15 papers between 2016 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
MCAT-UNet: Convolutional and Cross-Shaped Window Attention Enhanced UNet for Efficient High-Resolution Remote Sensing Image Segmentation.
IEEE J. Sel. Top. Appl. Earth Obs. Remote. Sens., 2024

A greedy randomized adaptive search procedure (GRASP) for minimum 2-fold connected dominating set problem.
Appl. Soft Comput., 2024

2023
A new local search algorithm with greedy crossover restart for the dominating tree problem.
Expert Syst. Appl., November, 2023

Multi-surrogate assisted PSO with adaptive speciation for expensive multimodal multi-objective optimization.
Appl. Soft Comput., November, 2023

A greedy randomized adaptive search procedure (GRASP) for minimum weakly connected dominating set problem.
Expert Syst. Appl., April, 2023

2022
Improving local search for the weighted sum coloring problem using the branch-and-bound algorithm.
Knowl. Based Syst., 2022

HEA-D: A Hybrid Evolutionary Algorithm for Diversified Top-k Weight Clique Search Problem.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

2021
Local search for weighted sum coloring problem.
Appl. Soft Comput., 2021

2019
Augmenting Negation Normal Form With Irrelevant Variables.
IEEE Access, 2019

An Improved Programming Model for Thread-Level Speculation.
Proceedings of the 2019 IEEE Intl Conf on Parallel & Distributed Processing with Applications, 2019

A Parallel BMH String Matching Algorithm Based on OpenMP.
Proceedings of the 21st IEEE International Conference on High Performance Computing and Communications; 17th IEEE International Conference on Smart City; 5th IEEE International Conference on Data Science and Systems, 2019

2018
New stochastic local search approaches for computing preferred extensions of abstract argumentation.
AI Commun., 2018

2017
A New Method for Computing Preferred Extensions.
Proceedings of the 2nd International Conference on Intelligent Information Processing, 2017

2016
Security analysis model, system architecture and relational model of enterprise cloud services.
Int. J. Autom. Comput., 2016

A New Stochastic Local Search Approach for Computing Preferred Extensions of Abstract Argumentation.
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016


  Loading...