Search Results for author:
Found 2 papers, 0 papers with code
Diversified Top-k Partial MaxSAT Solving
We introduce a diversified top-k partial MaxSAT problem, a combination of partial MaxSAT problem and enumeration problem.
Approximate Counting CSP Solutions Using Partition Function
This allows us to directly plug the marginal probabilities into the partition function and efficiently count the number of solutions for CSP.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
