Show simple item record

dc.contributor.authorCai, Shaowei
dc.contributor.authorLuo, Chuan
dc.contributor.authorSu, Kaile
dc.date.accessioned2018-03-09T03:47:46Z
dc.date.available2018-03-09T03:47:46Z
dc.date.issued2015
dc.identifier.issn1460-2067
dc.identifier.doi10.1093/comjnl/bxu135
dc.identifier.urihttp://hdl.handle.net/10072/99188
dc.description.abstractStochastic local search (SLS) algorithms are well known for their ability to efficiently find models of random instances of the Boolean satisfiability (SAT) problem. One of the most famous SLS algorithms for SAT is WalkSAT, which is an initial algorithm that has wide influence and performs very well on random 3-SAT instances. However, the performance of WalkSAT on random k-SAT instances with k > 3 lags far behind. Indeed, there are limited works on improving SLS algorithms for such instances. This work takes a good step toward this direction. We propose a novel concept namely multilevel make. Based on this concept, we design a scoring function called linear make, which is utilized to break ties in WalkSAT, leading to a new algorithm called WalkSATlm. Our experimental results show that WalkSATlm improves WalkSAT by orders of magnitude on random k-SAT instances with k > 3 near the phase transition. Additionally, we propose an efficient implementation for WalkSATlm, which leads to a speedup of 100%. We also give some insights on different forms of linear make functions, and show the limitation of the linear make function on random 3-SAT through theoretical analysis.
dc.description.peerreviewedYes
dc.languageEnglish
dc.language.isoeng
dc.publisherOxford University Press
dc.relation.ispartofpagefrom2864
dc.relation.ispartofpageto2875
dc.relation.ispartofissue11
dc.relation.ispartofjournalThe Computer Journal
dc.relation.ispartofvolume58
dc.subject.fieldofresearchApplied Mathematics not elsewhere classified
dc.subject.fieldofresearchInformation and Computing Sciences
dc.subject.fieldofresearchcode010299
dc.subject.fieldofresearchcode08
dc.titleImproving WalkSAT By Effective Tie-Breaking and Efficient Implementation
dc.typeJournal article
dc.type.descriptionC1 - Articles
dc.type.codeC - Journal Articles
gro.hasfulltextNo Full Text
gro.griffith.authorSu, Kaile


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

  • Journal articles
    Contains articles published by Griffith authors in scholarly journals.

Show simple item record