Modified extremal optimization for the hard maximum satisfiability problem[J]. 信息与电子工程前沿(英文), 2011,12(7):589-596.
Guo-qiang ZENG, Yong-zai LU, Wei-Jie MAO. Modified extremal optimization for the hard maximum satisfiability problem[J]. Frontiers of Information Technology & Electronic Engineering, 2011, 12(7): 589-596.
Modified extremal optimization for the hard maximum satisfiability problem[J]. 信息与电子工程前沿(英文), 2011,12(7):589-596. DOI: 10.1631/jzus.C1000313.
Guo-qiang ZENG, Yong-zai LU, Wei-Jie MAO. Modified extremal optimization for the hard maximum satisfiability problem[J]. Frontiers of Information Technology & Electronic Engineering, 2011, 12(7): 589-596. DOI: 10.1631/jzus.C1000313.
Modified extremal optimization for the hard maximum satisfiability problem
Based on our recent study on probability distributions for evolution in extremal optimization (EO)
we propose a modified framework called EOSAT to approximate ground states of the hard maximum satisfiability (MAXSAT) problem
a generalized version of the satisfiability (SAT) problem. The basic idea behind EOSAT is to generalize the evolutionary probability distribution in the Bose-Einstein-EO (BE-EO) algorithm
competing with other popular algorithms such as simulated annealing and WALKSAT. Experimental results on the hard MAXSAT instances from SATLIB show that the modified algorithms are superior to the original BE-EO algorithm.
关键词
Keywords
references
The trial reading is over, you can activate your VIP account to continue reading.