output
20022009
most citedThe Kernel Polynomial Method

1.1k citations

Showing cs.AIShow all

10 papers · 1 filter

cs.AI2009

Flow-Based Propagators for the SEQUENCE and Related Global Constraints

Michael J. Maher, Nina Narodytska, Claude-Guy Quimper +1

We propose new filtering algorithms for the SEQUENCE constraint and some extensions of the SEQUENCE constraint based on network flows. We enforce domain consistency on the SEQUENCE…

cs.AI2009

Elicitation strategies for fuzzy constraint problems with missing preferences: algorithms and experimental studies

Mirco Gelain, Maria Pini, Francesca Rossi +2

Fuzzy constraints are a popular approach to handle preferences and over-constrained problems in scenarios where one needs to be cautious, such as in medical or space applications.…

cs.AI200910 cited

Manipulation and gender neutrality in stable marriage procedures

Maria Pini, Francesca Rossi, Brent Venable +1

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…

cs.AI20099 cited

Symmetries of Symmetry Breaking Constraints

George Katsirelos, Toby Walsh

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

cs.AI20096 cited

Restart Strategy Selection using Machine Learning Techniques

Shai Haim, Toby Walsh

Restart strategies are an important factor in the performance of conflict-driven Davis Putnam style SAT solvers. Selecting a good restart strategy for a problem instance can enhanc…

cs.AI200928 cited

Scenario-based Stochastic Constraint Programming

Suresh Manandhar, Armagan Tarim, Toby Walsh

To model combinatorial decision problems involving uncertainty and probability, we extend the stochastic constraint programming framework proposed in [Walsh, 2002] along a number o…