Villagra, Marcos and Barán, Benjamín (2008) A Global Convexity Analysis on the MAX-SAT Domain. In: 2nd International ICST Conference on Bio-Inspired Models of Network, Information, and Computing Systems.
![[thumbnail of 7484.pdf]](http://eprints.eai.eu/style/images/fileicons/application_pdf.png "7484.pdf")
PDF
7484.pdf
Download (331kB)
Abstract
To this day, there is little theoretical understanding on the mechanics of local search algorithms and metaheuristics. Therefore, this work studies the solution space of Random MAX-SAT, which is a SAT variant. This analysis is focused on the study of global convexity, which may be exploited by some
| Item Type: | Conference or Workshop Item (UNSPECIFIED) |
|---|---|
| Date Deposited: | 04 Mar 2026 08:44 |
| Last Modified: | 18 Apr 2026 04:33 |
| URI: | http://eprints.eai.eu/id/eprint/827 |
Actions (login required)
- View Item