The (unweighted) Maximum Satisfiability problem (MaxSat) is: given a boolean formula in conjunctive normal form, find a truth assignment that satisfies the most number of clauses....
In a parallel system with multiple CPUs, one of the key problems is to assign loop iterations to processors. This problem, known as the loop scheduling problem, has been studied i...
Mahmut T. Kandemir, Taylan Yemliha, Seung Woo Son,...
In this paper we propose a random set framework for learning linguistic models for prediction problems. We show how we can model prediction problems based on learning linguistic p...
Text categorization involves mapping of documents to a fixed set of labels. A similar but equally important problem is that of assigning labels to large corpora. With a deluge of ...
Abstract. Model checking is a technique for verifying that a finite-state concurrent system is correct with respect to its specification. In bounded model checking (BMC), the sys...
Shoham Ben-David, Richard J. Trefler, Grant E. Wed...