research
∙
03/14/2019
An Exact Algorithm for Minimum Weight Vertex Cover Problem in Large Graphs
This paper proposes a novel branch-and-bound(BMWVC) algorithm to exactly...
share
research
∙
05/31/2017
Diversified Top-k Partial MaxSAT Solving
We introduce a diversified top-k partial MaxSAT problem, a combination o...
research
∙
09/11/2013
Approximate Counting CSP Solutions Using Partition Function
We propose a new approximate method for counting the number of the solut...
research
∙
04/26/2011
Hybrid Tractable Classes of Binary Quantified Constraint Satisfaction Problems
In this paper, we investigate the hybrid tractability of binary Quantifi...
research
∙
02/24/2011
New Worst-Case Upper Bound for X3SAT
The rigorous theoretical analyses of algorithms for exact 3-satisfiabili...
research
∙
02/24/2011
New Worst-Case Upper Bound for #XSAT
An algorithm running in O(1.1995n) is presented for counting models for ...
research
∙
12/13/2010
Phase Transitions of Plan Modification in Conformant Planning
We explore phase transitions of plan modification, which mainly focus on...
research
∙
06/08/2010
