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, Atlanta, USA, Georgia,
Download
![[img]](http://eprints.soton.ac.uk/style/images/fileicons/application_pdf.png) |
PDF
- Accepted Version
Download (71Kb) |
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 |
| Divisions: | Faculty of Physical and Applied Science > Electronics and Computer Science > Comms, Signal Processing & Control |
| Item ID: | 268062 |
| Date Deposited: | 19 Oct 2009 09:35 |
| Last Modified: | 01 Mar 2012 15:57 |
| Contributors: | Qasem, Mohamed (Author) Prugel-Bennett, Adam (Author) |
| Date: | 2008 |
| Additional Information: | Event Dates: 2008 |
| Status: | Published |
| Further Information: | Google Scholar |
| URI: | http://eprints.soton.ac.uk/id/eprint/268062 |
Actions (login required)
 |
View Item |
