default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDangdang Niu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Xiaolin Nie, Quanli Zhang
, Yixin Qiao, Zijun Qi, Lilin Zhang, Dangdang Niu, Hongming Zhang:
A greedy randomized adaptive search procedure (GRASP) for minimum 2-fold connected dominating set problem. Appl. Soft Comput. 165: 112122 (2024)- [j9]Tao Wang, Chao Xu, Bin Liu, Guang Yang, Erlei Zhang, Dangdang Niu, Hongming Zhang:
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. 17: 9745-9758 (2024) - 2023
- [j8]Zhiming Lv, Dangdang Niu, Shuqin Li, Hongguang Sun:
Multi-surrogate assisted PSO with adaptive speciation for expensive multimodal multi-objective optimization. Appl. Soft Comput. 147: 110724 (2023) - [j7]Dangdang Niu, Xiaolin Nie, Lilin Zhang, Hongming Zhang, Minghao Yin:
A greedy randomized adaptive search procedure (GRASP) for minimum weakly connected dominating set problem. Expert Syst. Appl. 215: 119338 (2023) - [j6]Dangdang Niu, Bin Liu, Minghao Yin, Yupeng Zhou:
A new local search algorithm with greedy crossover restart for the dominating tree problem. Expert Syst. Appl. 229(Part A): 120353 (2023) - 2022
- [j5]Dangdang Niu, Bin Liu, Hongming Zhang, Minghao Yin:
Improving local search for the weighted sum coloring problem using the branch-and-bound algorithm. Knowl. Based Syst. 246: 108703 (2022) - [c5]Jun Wu, Chu Min Li, Yupeng Zhou, Minghao Yin, Xin Xu, Dangdang Niu:
HEA-D: A Hybrid Evolutionary Algorithm for Diversified Top-k Weight Clique Search Problem. IJCAI 2022: 4821-4827 - 2021
- [j4]Dangdang Niu, Bin Liu, Minghao Yin:
Local search for weighted sum coloring problem. Appl. Soft Comput. 106: 107290 (2021)
2010 – 2019
- 2019
- [j3]Dangdang Niu, Lei Liu, Shuai Lü:
Augmenting Negation Normal Form With Irrelevant Variables. IEEE Access 7: 91360-91366 (2019) - [c4]Xiao Qi, Bin Liu, Yuancheng Li, Yanning Du, Yuxiang Li, Dangdang Niu:
A Parallel BMH String Matching Algorithm Based on OpenMP. HPCC/SmartCity/DSS 2019: 75-81 - [c3]Bin Liu, Hao Yang, Yuancheng Li, Yuxiang Li, Dangdang Niu, Zhiming Lv:
An Improved Programming Model for Thread-Level Speculation. ISPA/BDCloud/SocialCom/SustainCom 2019: 666-672 - 2018
- [j2]Dangdang Niu, Lei Liu, Shuai Lü:
New stochastic local search approaches for computing preferred extensions of abstract argumentation. AI Commun. 31(4): 369-382 (2018) - 2017
- [c2]Xindi Zhang, Xiaojie Xie, Yancen Pan, Dangdang Niu, Shuai Lü:
A New Method for Computing Preferred Extensions. ICIIP 2017: 3:1-3:6 - 2016
- [j1]Dangdang Niu, Lei Liu, Xin Zhang, Shuai Lü, Zhuang Li:
Security analysis model, system architecture and relational model of enterprise cloud services. Int. J. Autom. Comput. 13(6): 574-584 (2016) - [c1]Dangdang Niu, Lei Liu, Shuai Lü:
A New Stochastic Local Search Approach for Computing Preferred Extensions of Abstract Argumentation. ECAI 2016: 1652-1653
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 20:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
