A Parameterized Runtime Analysis of Evolutionary Algorithms for ...
A Parameterized Runtime Analysis of Evolutionary Algorithms for ...
A Parameterized Runtime Analysis of Evolutionary Algorithms for ...
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
School <strong>of</strong> Computer Science, University <strong>of</strong> Adelaide<br />
MAX-2-SAT<br />
• Maximum 2-Satisfiability Problem<br />
• C = {(l1,1 ∨ l1,2), (l2,1 ∨ l2,2), . . . , (lm,1 ∨ lm,2)}<br />
• eg C = {(¬v1 ∨ v2), (v1 ∨ v3), . . . , (v6 ∨ vn)}<br />
• m clauses, C i = {l 1 , ... , l m }<br />
• n Boolean variables v i = true/false<br />
Life Impact | The University <strong>of</strong> Adelaide
![Final Draft Thesis [pdf] - School of Computer Science](https://img.yumpu.com/30448543/1/184x260/final-draft-thesis-pdf-school-of-computer-science.jpg?quality=85)
Change language