Andrew W. Burnett
Systematic search for local-search SAT heuristics
Burnett, Andrew W.; Parkes, Andrew J.
Authors
Andrew J. Parkes
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.
Citation
Burnett, A. W., & Parkes, A. J. (2016). Systematic search for local-search SAT heuristics.
Conference Name | 6th International Conference on Metaheuristics and Nature Inspired Computing (META 2016) |
---|---|
End Date | Oct 31, 2016 |
Acceptance Date | Jun 11, 2016 |
Publication Date | Oct 29, 2016 |
Deposit Date | Jul 21, 2016 |
Publicly Available Date | Oct 29, 2016 |
Peer Reviewed | Peer Reviewed |
Public URL | https://nottingham-repository.worktribe.com/output/821007 |
Related Public URLs | http://meta2016.sciencesconf.org/ |
Files
BurnettParkes-META2016.pdf
(192 Kb)
PDF
You might also like
Acoustic topology optimisation using CMA-ES
(2020)
Conference Proceeding
Metaheuristic optimisation of sound absorption performance of multilayered porous materials
(2019)
Conference Proceeding
Learning the Quality of Dispatch Heuristics Generated by Automated Programming
(2018)
Book Chapter
Downloadable Citations
About Repository@Nottingham
Administrator e-mail: digital-library-support@nottingham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search