Junping Zhou

According to our database1, Junping Zhou authored at least 23 papers between 2010 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Enhance Diversified Top-k MaxSAT Solving by Incorporating New Strategy for Generating Diversified Initial Assignments (Student Abstract).
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
LS-DTKMS: A Local Search Algorithm for Diversified Top-k MaxSAT Problem.
Proceedings of the 26th International Conference on Theory and Applications of Satisfiability Testing, 2023

2022
AllSATCC: Boosting AllSAT Solving with Efficient Component Analysis.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

2021
An improved configuration checking-based algorithm for the unicost set covering problem.
Eur. J. Oper. Res., 2021

Solving diversified top-k weight clique search problem.
Sci. China Inf. Sci., 2021

2020
Local search for diversified Top-<i>k</i> clique search problem.
Comput. Oper. Res., 2020

2019
An Exact Algorithm for Minimum Weight Vertex Cover Problem in Large Graphs.
CoRR, 2019

2017
Diversified Top-k Partial MaxSAT Solving.
CoRR, 2017

Phase Transition for Maximum Not-All-Equal Satisfiability.
Proceedings of the Frontiers in Algorithmics - 11th International Workshop, 2017

2014
New Worst-Case upper Bound for Counting Exact Satisfiability.
Int. J. Found. Comput. Sci., 2014

2013
Internal and External Optical Feedback Effect in Fiber Linear Lasers.
J. Networks, 2013

Approximate Counting CSP Solutions Using Partition Function.
CoRR, 2013

2012
Phase Transitions of EXPSPACE-Complete Problems: a Further Step.
Int. J. Found. Comput. Sci., 2012

The Worst-Case Upper Bound for Exact 3-Satisfiability with the Number of Clauses as the Parameter.
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012

2011
New Worst-Case Upper Bound for X3SAT
CoRR, 2011

New Worst-Case Upper Bound for #XSAT
CoRR, 2011

A perturb biogeography based optimization with mutation for global numerical optimization.
Appl. Math. Comput., 2011

Hybrid Tractable Classes of Binary Quantified Constraint Satisfaction Problems.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010
Phase Transitions of EXPSPACE-Complete Problems.
Int. J. Found. Comput. Sci., 2010

Phase Transitions of Plan Modification in Conformant Planning
CoRR, 2010

New worst upper bound for #SAT
CoRR, 2010

An effective GSA based memetic algorithm for permutation flow shop scheduling.
Proceedings of the IEEE Congress on Evolutionary Computation, 2010

New Worst-Case Upper Bound for #2-SAT and #3-SAT with the Number of Clauses as the Parameter.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010


  Loading...