![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Jingchao Chen
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j5]Ning Dai
, Zhehao Lu, Jingchao Chen, Kaixin Xu, Xudong Hu, Yanhong Yuan
:
Research on the Algorithm of Position Correction for High-Speed Moving Express Packages Based on Traditional Vision and AI Vision. Sensors 24(3): 892 (2024) - 2023
- [j4]Long-Hao Jia, Yingjian Wu, Yanqi Dong, Jingchao Chen, Wei-Hua Chen, Xing-Ming Zhao:
A survey on computational strategies for genome-resolved gut metagenomics. Briefings Bioinform. 24(3) (2023) - 2021
- [c12]Jingchao Chen, Shiyi Mu, Shugong Xu, Youdong Ding:
HENet: Forcing a Network to Think More for Font Recognition. AISS 2021: 8:1-8:5 - [c11]Jyoti Singh, Jingchao Chen:
Deadline Aware Task Submission and Dynamic Virtual Machine Creation Technique in Cloud Computing. ICCBN 2021: 115-122 - [i11]Jingchao Chen, Shiyi Mu, Shugong Xu, Youdong Ding:
HENet: Forcing a Network to Think More for Font Recognition. CoRR abs/2110.10872 (2021) - 2020
- [c10]Jingchao Chen:
Fast Verifying Proofs of Propositional Unsatisfiability via Window Shifting. ISAIM 2020
2010 – 2019
- 2019
- [c9]Jyoti Singh, Jingchao Chen:
Optimizing Energy Consumption for Cloud Computing: A Cluster and Migration Based Approach (CMBA). CSAI 2019: 28-32 - [c8]Ming Zhao, Jingchao Chen, Mengyao Xu:
Comparison of Accuracy Estimation for Weighted k-Nearest Neighbor Classifiers. FSDM 2019: 783-791 - [i10]Jingchao Chen:
Core First Unit Propagation. CoRR abs/1907.01192 (2019) - 2016
- [i9]Jingchao Chen:
Improving SAT Solvers via Blocked Clause Decomposition. CoRR abs/1604.00536 (2016) - [i8]Jingchao Chen:
Improving abcdSAT by At-Least-One Recently Used Clause Management Strategy. CoRR abs/1605.01622 (2016) - [i7]Jingchao Chen:
Fast Verifying Proofs of Propositional Unsatisfiability via Window Shifting. CoRR abs/1611.04838 (2016) - 2015
- [i6]Jingchao Chen:
Fast Blocked Clause Decomposition with High Quality. CoRR abs/1507.00459 (2015) - 2014
- [c7]Jingchao Chen:
A Bit-Encoding Phase Selection Strategy for Satisfiability Solvers. TAMC 2014: 158-167 - 2012
- [j3]Jingchao Chen, Rongqing Zhang
, Lingyang Song, Zhu Han, Bingli Jiao:
Joint Relay and Jammer Selection for Secure Two-Way Relay Networks. IEEE Trans. Inf. Forensics Secur. 7(1): 310-320 (2012) - [i5]Jingchao Chen:
A Dynamic Phase Selection Strategy for Satisfiability Solvers. CoRR abs/1208.1613 (2012) - 2011
- [c6]Jingchao Chen, Lingyang Song, Zhu Han, Bingli Jiao:
Joint Relay and Jammer Selection for Secure Decode-and-Forward Two-Way Relay Communications. GLOBECOM 2011: 1-5 - [c5]Jingchao Chen, Rongqing Zhang
, Lingyang Song, Zhu Han, Bingli Jiao:
Joint Relay and Jammer Selection for Secure Two-Way Relay Networks. ICC 2011: 1-5 - [i4]Jingchao Chen:
Solving Rubik's Cube Using SAT Solvers. CoRR abs/1105.1436 (2011) - [i3]Jingchao Chen:
Exploiting Dynamically Propositional Logic Structures in SAT. CoRR abs/1106.1370 (2011) - [i2]Jingchao Chen:
Phase Selection Heuristics for Satisfiability Solvers. CoRR abs/1106.1372 (2011) - [i1]Jingchao Chen, Rongqing Zhang, Lingyang Song, Zhu Han, Bingli Jiao:
Joint Relay and Jammer Selection for Secure Two-Way Relay Networks. CoRR abs/1111.7108 (2011)
2000 – 2009
- 2009
- [j2]Renxia Wan, Jingchao Chen, Lixin Wang, Xiaoke Su:
Grid-based clustering over an evolving data stream. Int. J. Data Min. Model. Manag. 1(4): 393-410 (2009) - [c4]Jingchao Chen:
Building a Hybrid SAT Solver via Conflict-Driven, Look-Ahead and XOR Reasoning Techniques. SAT 2009: 298-311 - 2008
- [c3]Huiqin Wang, Jingchao Chen:
Improving Self-Quotient Image Method of NPR. CSSE (6) 2008: 213-216 - 2003
- [j1]Jingchao Chen:
Optimizing stable in-place merging. Theor. Comput. Sci. 302(1-3): 191-210 (2003) - 2002
- [c2]Jingchao Chen:
An Improvement on Tree Selection Sort. ALENEX 2002: 194-206 - [c1]Jingchao Chen:
Efficient heuristic algorithms for finding multi-constrained paths. ICC 2002: 1074-1079
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-04-25 05:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint