Qasem, Mohamed and Prugel-Bennett, Adam
Complexity of Max-SAT using stochastic algorithms
At Proceedings of the 10th annual conference on Genetic and evolutionary computation, Georgia.
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.
Conference or Workshop Item
||Event Dates: 2008
|Venue - Dates:
||Proceedings of the 10th annual conference on Genetic and evolutionary computation, Georgia, 2008-01-01
||Southampton Wireless Group
||19 Oct 2009 09:35
||17 Apr 2017 18:39
|Further Information:||Google Scholar|
Actions (login required)