DMCA
Reactive Search, a history-based heuristic for MAX-SAT (1996)
| Venue: | ACM Journal of Experimental Algorithmics |
| Citations: | 27 - 1 self |
BibTeX
@ARTICLE{Battiti96reactivesearch,,
author = {Roberto Battiti and Marco Protasi},
title = {Reactive Search, a history-based heuristic for MAX-SAT},
journal = {ACM Journal of Experimental Algorithmics},
year = {1996},
volume = {2}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
The Reactive Search (RS) method proposes the integration of a simple history-based feedback scheme into local search for the on-line determination of free parameters. In this paper a new RS algorithm is proposed for the approximated solution of the Maximum Satisfiability problem: a component based on local search with temporary prohibitions is complemented with a reactive scheme that determines ("learns") the appropriate value of the prohibition parameter by monitoring the Hamming distance along the search trajectory (algorithm H-RTS). In addition, the non-oblivious functions recently introduced in the framework of approximation algorithms are used to discover a better local optimum in the initial part of the search.
Keyphrases
reactive search history-based heuristic local search hamming distance maximum satisfiability problem non-oblivious function simple history-based feedback scheme appropriate value reactive scheme search trajectory temporary prohibition free parameter local optimum new r algorithm approximation algorithm approximated solution prohibition parameter algorithm h-rts on-line determination initial part
