A New Stochastic Local Search Approach for Computing Preferred Extensions of Abstract Argumentation. - Dangdang Niu; Lei Liu; Shuai Lü 001 (ECAI, 2016)

Security analysis model, system architecture and relational model of enterprise cloud services. - Dangdang Niu; Lei Liu 040; Xin Zhang; Shuai Lü 001; Zhuang Li (Int. J. Autom. Comput., 2016)

A New Method for Computing Preferred Extensions. - Xindi Zhang; Xiaojie Xie; Yancen Pan; Dangdang Niu; Shuai Lü 001 (ICIIP, 2017)

New stochastic local search approaches for computing preferred extensions of abstract argumentation. - Dangdang Niu; Lei Liu 040; Shuai Lü 001 (AI Commun., 2018)

A Parallel BMH String Matching Algorithm Based on OpenMP. - Xiao Qi; Bin Liu; Yuancheng Li; Yanning Du; Yuxiang Li; Dangdang Niu (HPCC/SmartCity/DSS, 2019)

An Improved Programming Model for Thread-Level Speculation. - Bin Liu; Hao Yang; Yuancheng Li; Yuxiang Li; Dangdang Niu; Zhiming Lv (ISPA/BDCloud/SocialCom/SustainCom, 2019)

Augmenting Negation Normal Form With Irrelevant Variables. - Dangdang Niu; Lei Liu 040; Shuai Lü 001 (IEEE Access, 2019)

Local search for weighted sum coloring problem. - Dangdang Niu; Bin Liu 023; Minghao Yin (Appl. Soft Comput., 2021)

HEA-D: A Hybrid Evolutionary Algorithm for Diversified Top-k Weight Clique Search Problem. - Jun Wu 020; Chu Min Li 001; Yupeng Zhou; Minghao Yin; Xin Xu; Dangdang Niu (IJCAI, 2022)

Improving local search for the weighted sum coloring problem using the branch-and-bound algorithm. - Dangdang Niu; Bin Liu 023; Hongming Zhang 002; Minghao Yin (Knowl. Based Syst., 2022)

A greedy randomized adaptive search procedure (GRASP) for minimum weakly connected dominating set problem. - Dangdang Niu; Xiaolin Nie; Lilin Zhang; Hongming Zhang 002; Minghao Yin (Expert Syst. Appl., 2023)

Multi-surrogate assisted PSO with adaptive speciation for expensive multimodal multi-objective optimization. - Zhiming Lv; Dangdang Niu; Shuqin Li; Hongguang Sun (Appl. Soft Comput., 2023)

A new local search algorithm with greedy crossover restart for the dominating tree problem. - Dangdang Niu; Bin Liu 023; Minghao Yin; Yupeng Zhou (Expert Syst. Appl., 2023)

A greedy randomized adaptive search procedure (GRASP) for minimum 2-fold connected dominating set problem. - Xiaolin Nie; Quanli Zhang; Yixin Qiao; Zijun Qi; Lilin Zhang; Dangdang Niu; Hongming Zhang 002 (Appl. Soft Comput., 2024)

MCAT-UNet: Convolutional and Cross-Shaped Window Attention Enhanced UNet for Efficient High-Resolution Remote Sensing Image Segmentation. - Tao Wang 113; Chao Xu 007; Bin Liu 023; Guang Yang 033; Erlei Zhang; Dangdang Niu; Hongming Zhang 002 (IEEE J. Sel. Top. Appl. Earth Obs. Remote. Sens., 2024)