output
20042009
most citedKernel methods in machine learning

1.6k citations

Showing 2009 · cs.AIShow all

20 papers · 2 filters

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.AI20091 cited

Decomposition of the NVALUE constraint

Christian Bessiere, George Katsirelos, Nina Narodytska +2

We study decompositions of NVALUE, a global constraint that can be used to model a wide range of problems where values need to be counted. Whilst decomposition typically hinders pr…

cs.AI20091 cited

View-based Propagator Derivation

Christian Schulte, Guido Tack

When implementing a propagator for a constraint, one must decide about variants: When implementing min, should one also implement max? Should one implement linear constraints both…