Sciweavers

2354 search results - page 143 / 471
» Assignment Problems
Sort
View
142
Voted
JAL
2000
82views more  JAL 2000»
15 years 2 months ago
New Upper Bounds for Maximum Satisfiability
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....
Rolf Niedermeier, Peter Rossmanith
DATE
2007
IEEE
95views Hardware» more  DATE 2007»
15 years 8 months ago
Memory bank aware dynamic loop scheduling
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,...
EUSFLAT
2003
15 years 3 months ago
Fuzzy models for prediction based on random set semantics
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...
Nicholas J. Randon, Jonathan Lawry
FLAIRS
2006
15 years 3 months ago
Corpus Based Unsupervised Labeling of Documents
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 ...
Delip Rao, Deepak P, Deepak Khemani
149
Voted
TABLEAUX
2007
Springer
15 years 8 months ago
Bounded Model Checking with Description Logic Reasoning
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...