Systematic search for local-search SAT heuristics
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 i...
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2016
|
| Online Access: | https://eprints.nottingham.ac.uk/35222/ |
| _version_ | 1848795030838312960 |
|---|---|
| author | Burnett, Andrew W. Parkes, Andrew J. |
| author_facet | Burnett, Andrew W. Parkes, Andrew J. |
| author_sort | Burnett, Andrew W. |
| building | Nottingham Research Data Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-14T19:25:37Z |
| format | Conference or Workshop Item |
| id | nottingham-35222 |
| institution | University of Nottingham Malaysia Campus |
| institution_category | Local University |
| last_indexed | 2025-11-14T19:25:37Z |
| publishDate | 2016 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | nottingham-352222020-05-04T18:14:58Z https://eprints.nottingham.ac.uk/35222/ Systematic search for local-search SAT heuristics Burnett, Andrew W. Parkes, Andrew J. 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. 2016-10-29 Conference or Workshop Item PeerReviewed 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. |
| spellingShingle | Burnett, Andrew W. Parkes, Andrew J. Systematic search for local-search SAT heuristics |
| title | Systematic search for local-search SAT heuristics |
| title_full | Systematic search for local-search SAT heuristics |
| title_fullStr | Systematic search for local-search SAT heuristics |
| title_full_unstemmed | Systematic search for local-search SAT heuristics |
| title_short | Systematic search for local-search SAT heuristics |
| title_sort | systematic search for local-search sat heuristics |
| url | https://eprints.nottingham.ac.uk/35222/ |