881 search results - page 49 / 177 » Solving satisfiability problems with preferences |
FLAIRS
2010
13 years 9 months ago
2010
Recommender systems (RSs) are popular tools dealing with information overload problems in eCommerce Web sites. RSs match user preferences with item representations and recommend t...
ATAL
2010
Springer
13 years 9 months ago
2010
Springer
Service coordination in domains involving temporal constraints and duration uncertainty has previously been solved with a greedy algorithm that attempts to satisfy service requests...
ECCC
2008
13 years 8 months ago
2008
We obtain the first nontrivial time-space lower bound for quantum algorithms solving problems related to satisfiability. Our bound applies to MajSAT and MajMajSAT, which are compl...
CORR
2002
Springer
13 years 8 months ago
2002
Springer
We describe sequential and parallel algorithms that approximately solve linear programs with no negative coefficients (a.k.a. mixed packing and covering problems). For explicitly ...
CPAIOR
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. The multileaf collimator sequencing problem is an important component in effective cancer treatment delivery. The problem can be formulated as finding a decomposition of...