Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/77078
Type: | Conference paper |
Title: | Directed plateau search for MAX-k-SAT |
Author: | Sutton, Andrew M. Howe, Adele E. Whitley, L. Darrell |
Citation: | Proceedings of the Third Annual Symposium on Combinatorial Search, held in Atlanta, Georgia, 8-10 July, 2010: pp.90-97 |
Publisher: | AAAI Press |
Issue Date: | 2010 |
Conference Name: | Annual Symposium on Combinatorial Search (3rd : 2010 : Atlanta, Georgia USA) SOCS-10 |
School/Discipline: | School of Computer Science |
Statement of Responsibility: | Andrew M. Sutton, Adele E. Howe and L. Darrell Whitley |
Abstract: | Local search algorithms for MAX-k-SAT must often explore large regions of mutually connected equal moves, or plateaus, typically by taking random walks through the region. In this paper, we develop a surrogate plateau “gradient” function using aWalsh transform of the objective function. This function gives the mean value of the objective function over localized volumes of the search space. This information can be used to direct search through plateaus more quickly. The focus of this paper is on demonstrating that formal analysis of search space structure can direct existing algorithms in a more principled manner than random walks. We show that embedding the gradient computation into a hill-climbing local search for MAX-k-SAT improves its convergence profile. |
Rights: | © 2010, Association for the Advancement of Artificial Intelligence. All rights reserved. |
Published version: | http://www.aaai.org/ocs/index.php/SOCS/SOCS10/paper/view/2091 |
Appears in Collections: | Computer Science publications |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.