default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJunping Zhou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]Jiaxin Liang, Junping Zhou, Minghao Yin:
Enhance Diversified Top-k MaxSAT Solving by Incorporating New Strategy for Generating Diversified Initial Assignments (Student Abstract). AAAI 2024: 23561-23562- 2023
- [c7]Junping Zhou, Jiaxin Liang, Minghao Yin, Bo He:
LS-DTKMS: A Local Search Algorithm for Diversified Top-k MaxSAT Problem. SAT 2023: 29:1-29:16 - 2022
- [c6]Jiaxin Liang, Feifei Ma, Junping Zhou, Minghao Yin:
AllSATCC: Boosting AllSAT Solving with Efficient Component Analysis. IJCAI 2022: 1866-1872 - 2021
- [j8]Junping Zhou, Chumin Li, Yupeng Zhou, Mingyang Li, Lili Liang, Jianan Wang:
Solving diversified top-k weight clique search problem. Sci. China Inf. Sci. 64(5) (2021) - [j7]Yiyuan Wang
, Shiwei Pan, Sameh Al-Shihabi, Junping Zhou, Nan Yang, Minghao Yin:
An improved configuration checking-based algorithm for the unicost set covering problem. Eur. J. Oper. Res. 294(2): 476-491 (2021) - 2020
- [j6]Jun Wu, Chu-Min Li, Lu Jiang, Junping Zhou, Minghao Yin:
Local search for diversified Top-k clique search problem. Comput. Oper. Res. 116: 104867 (2020)
2010 – 2019
- 2019
- [i8]Luzhi Wang, Chu-Min Li, Junping Zhou, Bo Jin, Minghao Yin:
An Exact Algorithm for Minimum Weight Vertex Cover Problem in Large Graphs. CoRR abs/1903.05948 (2019) - 2017
- [c5]Junping Zhou, Shuli Hu, Tingting Zou, Minghao Yin:
Phase Transition for Maximum Not-All-Equal Satisfiability. FAW 2017: 267-279 - [i7]Junping Zhou, Huanyao Sun, Feifei Ma, Jian Gao, Ke Xu, Minghao Yin:
Diversified Top-k Partial MaxSAT Solving. CoRR abs/1706.00123 (2017) - 2014
- [j5]Junping Zhou, Weihua Su, Jianan Wang:
New Worst-Case upper Bound for Counting Exact Satisfiability. Int. J. Found. Comput. Sci. 25(6): 667-678 (2014) - 2013
- [j4]Junping Zhou, Jingming Xia, Yixian Ge, Eric Chernoff:
Internal and External Optical Feedback Effect in Fiber Linear Lasers. J. Networks 8(9): 1990-1996 (2013) - [i6]Junping Zhou, Weihua Su, Minghao Yin:
Approximate Counting CSP Solutions Using Partition Function. CoRR abs/1309.2747 (2013) - 2012
- [j3]Junping Zhou, Minghao Yin, Xiangtao Li, Jinyan Wang:
Phase Transitions of EXPSPACE-Complete Problems: a Further Step. Int. J. Found. Comput. Sci. 23(1): 173-184 (2012) - [c4]Junping Zhou, Minghao Yin:
The Worst-Case Upper Bound for Exact 3-Satisfiability with the Number of Clauses as the Parameter. FAW-AAIM 2012: 212-223 - 2011
- [j2]Xiangtao Li, Jinyan Wang, Junping Zhou, Minghao Yin:
A perturb biogeography based optimization with mutation for global numerical optimization. Appl. Math. Comput. 218(2): 598-609 (2011) - [c3]Jian Gao, Minghao Yin, Junping Zhou:
Hybrid Tractable Classes of Binary Quantified Constraint Satisfaction Problems. AAAI 2011: 1780-1781 - [i5]Junping Zhou, Minghao Yin:
New Worst-Case Upper Bound for #XSAT. CoRR abs/1102.4924 (2011) - [i4]Junping Zhou, Minghao Yin:
New Worst-Case Upper Bound for X3SAT. CoRR abs/1102.4926 (2011) - [i3]Jian Gao, Minghao Yin, Junping Zhou:
Hybrid Tractable Classes of Binary Quantified Constraint Satisfaction Problems. CoRR abs/1104.4910 (2011) - 2010
- [j1]Junping Zhou, Ping Huang, Minghao Yin, Chunguang Zhou:
Phase Transitions of EXPSPACE-Complete Problems. Int. J. Found. Comput. Sci. 21(6): 1073-1088 (2010) - [c2]Junping Zhou, Minghao Yin, Chunguang Zhou:
New Worst-Case Upper Bound for #2-SAT and #3-SAT with the Number of Clauses as the Parameter. AAAI 2010: 217-222 - [c1]Xiangtao Li, Jianan Wang, Junping Zhou, Minghao Yin:
An effective GSA based memetic algorithm for permutation flow shop scheduling. IEEE Congress on Evolutionary Computation 2010: 1-6 - [i2]Junping Zhou, Minghao Yin, Chunguang Zhou:
New worst upper bound for #SAT. CoRR abs/1006.1537 (2010) - [i1]Junping Zhou, Minghao Yin:
Phase Transitions of Plan Modification in Conformant Planning. CoRR abs/1012.2713 (2010)
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-20 23:01 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:
