Personification annealing algorithm for solving SAT problem

Jisuanji Xuebao/Chinese Journal of Computers

Volumn 25, Issue 2, 2002, Pages 148-152

  Zhang, De Fu ^a   Huang, Wen Qi ^a   Wang, Hou Xiang ^a  

^a HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Personification; SAT problem; Simulated annealing algorithm

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; OPTIMIZATION;

PERSONIFICATION; SATISFIABILITY PROBLEM; SIMULATED ANNEALING ALGORITHM;

SIMULATED ANNEALING;

EID: 0036463096     PISSN: 02544164     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (11)

1. The analysis of algorithms for the proposition logic satisfiability
2. Local search for satisfiability (SAT) problem
3. Local search for solving SAT problems and its average time complexity
4. A physic-mathematical method for solving conjunctive normal form satisfiability problem
5. Noise strategies for improving local search
6. The quasi-physical personification algorithm for solving SAT problem - Solar
7. Optimization by simulated annealing
8. Optimization by simulated annealing: An experimental evaluation - Part 11: Graph coloring and number partitioning
9. Personificational neural network algorithm for SAT problem
10. Towards a characterization of the behavior of stochastic local search algorithms for SAT