default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChenhui Cui
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Rubing Huang
, Chenhui Cui, Junlong Lian, Dave Towey, Weifeng Sun, Haibo Chen:
Toward Cost-Effective Adaptive Random Testing: An Approximate Nearest Neighbor Approach. IEEE Trans. Software Eng. 50(5): 1182-1214 (2024)- [i6]Chenhui Cui, Tao Li, Junjie Wang, Chunyang Chen, Dave Towey, Rubing Huang:
Large Language Models for Mobile GUI Text Input Generation: An Empirical Study. CoRR abs/2404.08948 (2024) - [i5]Tao Li, Chenhui Cui, Lei Ma, Dave Towey, Yujie Xie, Rubing Huang:
Leveraging Large Language Models for Automated Web-Form-Test Generation: An Empirical Study. CoRR abs/2405.09965 (2024) - [i4]Qi Dong, Rubing Huang, Chenhui Cui, Dave Towey, Ling Zhou, Jinyu Tian, Jianzhou Wang:
Short-Term Electricity-Load Forecasting by Deep Learning: A Comprehensive Survey. CoRR abs/2408.16202 (2024) - [i3]Zixiang Xian, Chenhui Cui, Rubing Huang, Chunrong Fang, Zhenyu Chen:
zsLLMCode: An Effective Approach for Functional Code Embedding via LLM with Zero-Shot Learning. CoRR abs/2409.14644 (2024) - 2023
- [j3]Rubing Huang, Chenhui Cui, Dave Towey, Weifeng Sun, Junlong Lian:
VPP-ART: An Efficient Implementation of Fixed-Size-Candidate-Set Adaptive Random Testing Using Vantage Point Partitioning. IEEE Trans. Reliab. 72(4): 1632-1647 (2023) - [i2]Rubing Huang, Chenhui Cui, Junlong Lian, Dave Towey, Weifeng Sun, Haibo Chen:
Toward Cost-effective Adaptive Random Testing: An Approximate Nearest Neighbor Approach. CoRR abs/2305.17496 (2023) - 2022
- [j2]Rubing Huang, Weifeng Sun, Haibo Chen, Chenhui Cui, Ning Yang:
A nearest-neighbor divide-and-conquer approach for adaptive random testing. Sci. Comput. Program. 215: 102743 (2022) - [j1]Chenhui Cui, Yujie Duan, Hongli Hu, Liang Wang, Qing Liu:
Detection and Classification of Multiple Power Quality Disturbances Using Stockwell Transform and Deep Learning. IEEE Trans. Instrum. Meas. 71: 1-12 (2022) - 2021
- [c4]Junlong Lian, Chenhui Cui, Weifeng Sun, Yiming Wu, Rubing Huang:
KD-RRT: Restricted Random Testing based on K-Dimensional Tree. DSA 2021: 590-599 - [c3]Weifeng Sun, Rubing Huang, Chenhui Cui, Haibo Chen, Weijie Liu:
Which type of exclusion region is better for restricted random testing?: an empirical study. SAC 2021: 1576-1579 - [i1]Rubing Huang, Chenhui Cui, Dave Towey, Weifeng Sun, Junlong Lian:
VPPS-ART: An Efficient Implementation of Fixed-Size-Candidate-Set Adaptive Random Testing using Vantage Point Partitioning Strategy. CoRR abs/2105.06056 (2021) - 2020
- [c2]Rubing Huang, Chenhui Cui, Weifeng Sun, Dave Towey:
Poster: Is Euclidean Distance the best Distance Measurement for Adaptive Random Testing? ICST 2020: 406-409
2010 – 2019
- 2017
- [c1]Mu Zhang, Yan Zheng, Chenhui Cui, Zhaopeng Meng, Chung-Ming Own:
Preliminary Application of Gesture Recognition to Virtual Acupuncture. ISCID (1) 2017: 366-369
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 2025-01-09 13:26 CET 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:
