38 search results - page 2 / 8 » A New Algorithm for Weighted Partial MaxSAT |
SAT
2009
Springer
14 years 5 days ago
2009
Springer
We investigate the role of cycles structures (i.e., subsets of clauses of the form ¯l1 ∨ l2, ¯l1 ∨ l3, ¯l2 ∨ ¯l3) in the quality of the lower bound (LB) of modern MaxSAT ...
AI
2003
Springer
13 years 11 months ago
2003
Springer
MAX-SAT, the optimisation variant of the satisfiability problem in propositional logic, is an important and widely studied combinatorial optimisation problem with applications in ...
DLOG
2011
12 years 9 months ago
2011
Abstract. For a number of problems, such as ontology learning or image labeling, we need to handle uncertainty and inconsistencies in an appropriate way. Fuzzy and Probabilistic De...
WWW
2010
ACM
14 years 18 days ago
2010
ACM
We introduce a new dissimilarity function for ranked lists, the expected weighted Hoeffding distance, that has several advantages over current dissimilarity measures for ranked s...
ICCTA
2007
IEEE
13 years 12 months ago
2007
IEEE
We study the dynamic version of the distributed all-pairs shortest paths problem. Most of the solutions given in the literature for this problem work under the assumption that bef...