Systematic search for local-search SAT heuristics

Tools

Burnett, Andrew W. and Parkes, Andrew J. (2016) Systematic search for local-search SAT heuristics. In: 6th International Conference on Metaheuristics and Nature Inspired Computing (META 2016), 27-31 Oct 2016, Marrakech, Morocco.

Full text not available from this repository.

Abstract

Heuristics for local-search are a commonly used method of improving the performance of algorithms that solve hard computational problems. Generally these are written by human experts, however a long-standing research goal has been to automate the construction of these heuristics. In this paper, we investigate the applicability of a systematic search on the space of heuristics to be used in a local-search SAT solver.

Item Type: Conference or Workshop Item (Paper)
RIS ID: https://nottingham-repository.worktribe.com/output/821007
Schools/Departments: University of Nottingham, UK > Faculty of Science > School of Computer Science
Related URLs:
URLURL Type
http://meta2016.sciencesconf.org/UNSPECIFIED
Depositing User: Parkes, Andrew
Date Deposited: 21 Jul 2016 09:52
Last Modified: 04 May 2020 18:14
URI: https://eprints.nottingham.ac.uk/id/eprint/35222

Actions (Archive Staff Only)

Edit View Edit View