no code implementations • 18 Sep 2017 • Begum Genc, Mohamed Siala, Gilles Simonin, Barry O'Sullivan
Then, we show the equivalence between the SAT formulation and finding a (1, 1)-supermatch on a specific family of instances.
no code implementations • 24 May 2017 • Begum Genc, Mohamed Siala, Barry O'Sullivan, Gilles Simonin
We first define robustness by introducing (a, b)-supermatches.
