Abstract
within constraint satisfaction problems (CSPs), our work proposes a new search heuristic. The latter is basically inspired by the template concept introduced by E.P.K. TSANG. It consists of a new template concept and could be classified as a min-conflict heuristic. In this paper we introduce a new guided local search that uses our heuristic in local search (LS) for Maximal constraint satisfaction problems (Max-CSPs). Compared to previous well known guided local search, our approach changes experimental results for the better.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
