output
20022013
most citedThe Kernel Polynomial Method

1.1k citations

Showing 2010 · cs.AIShow all

6 papers · 2 filters

cs.AI2010

Improving the Performance of maxRPC

Thanasis Balafoutis, Anastasia Paparrizou, Kostas Stergiou +1

Max Restricted Path Consistency (maxRPC) is a local consistency for binary constraints that can achieve considerably stronger pruning than arc consistency. However, existing maxRRC…

cs.AI2010

Local search for stable marriage problems with ties and incomplete lists

Mirco Gelain, Maria Silvia Pini, Francesca RossI +2

The stable marriage problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more generally to…

cs.AI2010

Online Cake Cutting

Toby Walsh

We propose an online form of the cake cutting problem. This models situations where players arrive and depart during the process of dividing a resource. We show that well known fai…

cs.AI2010

Symmetries of Symmetry Breaking Constraints

George Katsirelos, Toby Walsh

Symmetry is an important feature of many constraint programs. We show that any problem symmetry acting on a set of symmetry breaking constraints can be used to break symmetry. Diff…

cs.AI20101 cited

Propagating Conjunctions of AllDifferent Constraints

Christian Bessiere, George Katsirelos, Nina Narodytska +2

We study propagation algorithms for the conjunction of two AllDifferent constraints. Solutions of an AllDifferent constraint can be seen as perfect matchings on the variable/value…

cs.AI20107 cited

Symmetry within Solutions

Marijn Heule, Toby Walsh

We define the concept of an internal symmetry. This is a symmety within a solution of a constraint satisfaction problem. We compare this to solution symmetry, which is a mapping be…