881 search results - page 24 / 177 » Solving satisfiability problems with preferences |
AAAI
2007
13 years 11 months ago
2007
We propose a novel kernel regression algorithm which takes into account order preferences on unlabeled data. Such preferences have the form that point x1 has a larger target value...
CAISE
2008
Springer
13 years 10 months ago
2008
Springer
e-Services are just like normal services, but can be ordered and provisioned via the Internet completely. Increasingly, these e-services are offered as a multi-supplier bundle of e...
SIGECOM
2011
ACM
12 years 11 months ago
2011
ACM
Recent results in complexity theory suggest that various economic theories require agents to solve computationally intractable problems. However, such results assume the agents ar...
AI
2005
Springer
13 years 8 months ago
2005
Springer
Maximum Boolean satisfiability (max-SAT) is the optimization counterpart of Boolean satisfiability (SAT), in which a variable assignment is sought to satisfy the maximum number of...
ECSQARU
2009
Springer
14 years 3 months ago
2009
Springer
Many computational problems linked to reasoning under uncertainty can be expressed in terms of computing the marginal(s) of the combination of a collection of (local) valuation fun...