881 search results - page 21 / 177 » Solving satisfiability problems with preferences |
MFCS
2010
Springer
13 years 7 months ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
DFT
2005
IEEE
14 years 2 months ago
2005
IEEE
Fabricating large memory and processor arrays is subject to physical failures resulting in yield degradation. The strategy of incorporating spare rows and columns to obtain reason...
NIPS
2004
13 years 10 months ago
2004
Choice-based conjoint analysis builds models of consumer preferences over products with answers gathered in questionnaires. Our main goal is to bring tools from the machine learni...
GLOBECOM
2008
IEEE
14 years 3 months ago
2008
IEEE
—In this paper, we address the problem of establishing full connectivity and satisfying required traffic capacity between disconnected clusters in large wireless ad-hoc ground n...
ICLP
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Constraints and preferences are ubiquitous in real-life. Moreover, preferences can be of many kinds: qualitative, quantitative, conditional, positive or negative, to name...