Computer Science

Computer Science

Recently added

  • Chisca, Danuta Sorina; Siala, Mohamed; Simonin, Gilles; O'Sullivan, Barry (IEEE, 2017)
    We study the problem of matching a set of applicants to a set of posts, where each applicant has an ordinal preference list, which may contain ties, ranking a subset of posts. A matching M is popular if there exists no ...
  • Genc, Begum; Siala, Mohamed; Simonin, Gilles; O'Sullivan, Barry (International Joint Conferences on Artificial Intelligence Organization, 2017-08)
    We study the notion of robustness in stable matching problems. We first define robustness by introducing (a,b)-supermatches. An (a,b)-supermatch is a stable matching in which if a pairs break up it is possible to find ...
  • Siala, Mohamed; O'Sullivan, Barry (Springer International Publishing, 2017-08-23)
    We introduce new CP models for the many-to-many stable matching problem. We use the notion of rotation to give a novel encoding that is linear in the input size of the problem. We give extra filtering rules to maintain arc ...
  • Genc, Begum; Siala, Mohamed; Simonin, Gilles; O'Sullivan, Barry (Springer International Publishing, 2017-11-16)
    Robust Stable Marriage (RSM) is a variant of the classical Stable Marriage problem, where the robustness of a given stable matching is measured by the number of modifications required for repairing it in case an unforeseen ...
  • Hebrard, Emmanuel; Siala, Mohamed (Springer International Publishing, 2017-05-31)
    The weighted degree heuristic is among the state of the art generic variable ordering strategies in constraint programming. However, it was often observed that when using large arity constraints, its efficiency deteriorates ...

View more

This website uses cookies. By using this website, you consent to the use of cookies in accordance with the UCC Privacy and Cookies Statement. For more information about cookies and how you can disable them, visit our Privacy and Cookies statement