292 search results - page 5 / 59 » Are Stable Instances Easy |
118
Voted
JCO
2008
15 years 20 days ago
2008
We study variants of classical stable matching problems in which there is an additional requirement for a stable matching, namely that there should not be two participants who wou...
IRI
2003
IEEE
15 years 6 months ago
2003
IEEE
— The AnyLog pattern models the core knowledge of any Log, as a written record. The Log finds extensive use in the computing industry. The pattern makes it easy to model differen...
114
Voted
IJAR
2010
14 years 11 months ago
2010
The logical and algorithmic properties of stable conditional independence (CI) as an alternative structural representation of conditional independence information are investigated...
144
Voted
AAMAS
2011
Springer
14 years 7 months ago
2011
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 a...
97
Voted
IJCAI
1997
15 years 2 months ago
1997
Evaluation of incomplete algorithms that solve SAT requires to generate hard satisfiable instances. For that purpose, the kSAT uniform random generation is not usable. The other g...