Memoisation for constraint-based local search

Authors:
Magnus Ågren
Affiliations:
Swedish Institute of Computer Science, Kista, Sweden
Venue:
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Year:
2009

Citing 4
Cited 0

Constraint-Based Local Search

Constraint-Based Local Search
Generic Incremental Algorithms for Local Search

Constraints
Structural symmetry breaking

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Differentiable invariants

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a memoisation technique for constraint-based local search based on the observation that penalties with respect to some interchangeable elements need only be calculated once. We apply the technique to constraint-based local search on set variables, and demonstrate the usefulness of the approach by significantly speeding up the penalty calculation of a commonly used set constraint.