Ågren, Magnus (2009) Memoisation for constraint-based local search. In: CP 2009, 21-24 Sep 2009, Lisbon, Portugal.
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/978-3-642-04244-7_12
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.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| ID Code: | 3656 |
| Deposited By: | Magnus Å gren |
| Deposited On: | 13 Oct 2009 |
| Last Modified: | 18 Nov 2009 16:25 |
Repository Staff Only: item control page
