BibTeX
@MISC{_memoisationfor,
author = {},
title = {Memoisation for constraint-based local search},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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. 1 Introduction and
