Complexity of Max-SAT using stochastic algorithms


Qasem, Mohamed and Prugel-Bennett, Adam (2008) Complexity of Max-SAT using stochastic algorithms At Proceedings of the 10th annual conference on Genetic and evolutionary computation, Georgia.

Download

[img] PDF t07pap188-qasem.pdf - Accepted Manuscript
Download (73kB)

Description/Abstract

Hill-climbing has been shown to be more effective than exhaustive search in solving satisfiability problems.Also, it has been used either by itself or in combination with other methods to solve the most difficult region of SAT, the phase transition. We show that hill-climbing also finds SAT problems difficult around the phase transition. It too follows an easy-hard-eays transition.

Item Type: Conference or Workshop Item (Poster)
Additional Information: Event Dates: 2008
Venue - Dates: Proceedings of the 10th annual conference on Genetic and evolutionary computation, Georgia, 2008-01-01
Organisations: Southampton Wireless Group
ePrint ID: 268062
Date :
Date Event
2008Published
Date Deposited: 19 Oct 2009 09:35
Last Modified: 17 Apr 2017 18:39
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/268062

Actions (login required)

View Item View Item