1260 search results - page 21 / 252 » Bipolar Preference Problems |
IEEESCC
2009
IEEE
14 years 4 months ago
2009
IEEE
In many applications involving composite Web services, one or more component services may become unavailable. This presents us with the problem of identifying other components tha...
WAOA
2005
Springer
14 years 3 months ago
2005
Springer
An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, ...
AAAI
2006
13 years 11 months ago
2006
The importance of the problems of contingent planning with actions that have non-deterministic effects and of planning with goal preferences has been widely recognized, and severa...
FQAS
2006
Springer
14 years 1 months ago
2006
Springer
Preference-based search is the problem of finding an item that matches best with a user's preferences. User studies show that example-based tools for preference-based search c...
ECAI
2006
Springer
13 years 11 months ago
2006
Springer
We use a lexicographical preference order on the problem space to combine solution synthesis with conflict learning. Given two preferred solutions of two subproblems, we can either...