292 search results - page 4 / 59 » Are Stable Instances Easy |
107
Voted
WAOA
2005
Springer
15 years 6 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”, ...
113
Voted
ATAL
2009
Springer
15 years 7 months ago
2009
Springer
Coalition formation is a key topic in multi–agent systems (mas). Coalitions enable agents to achieve goals that they may not have been able to achieve independently, and encoura...
122
Voted
SIGAL
1990
15 years 4 months ago
1990
Many intractable problems such as NP-complete problems (provided P = NP) have easy subproblems. In contrast, we investigate the existence and the properties of inherently hard sub...
187
Voted
ICDE
2001
IEEE
16 years 2 months ago
2001
IEEE
Due to the ubiquity and popularity of XML, users often are in the following situation: they want to query XML documents which contain potentially interesting information but they ...
119
click to vote
ATAL
2009
Springer
15 years 7 months ago
2009
Springer
The stable marriage problem is a well-known problem of matching men to women so that no man and woman who are not married to each other both prefer each other. Such a problem has ...