.png){kind=icon}
返回
ISSATA: An algorithm for solving the 3-satisfiability problem based on improved strategy
.png){kind=icon}
PRE
AI
DOI：10.1007/s10489-021-02493-1.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Stochastic local search algorithm with configuration check strategy can effectively solve random satisfiability instances, so configuration check strategy is widely used in combinatorial optimization problems. Inspired by this, we proposed an ISSATA algorithm to solve the 3-satisfiability problem. In this algorithm, a new initialization strategy is given, which can assign initial values to variables more efficiently. At the same time, a new variable selection strategy and a new neighbor priority strategy are proposed to improve the performance of selecting flipped variables. Comparative experiments conducted in public datasets show that ISSATA has better solution accuracy and efficiency.
Keyword:
Combinatorial optimization
Heuristic algorithm
Satisfiability problem
Stochastic local search
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.5
论文数:
7.6K
被引数:
1.7W
机构
引用论文
Crystallization of partially disentangled polypropylene in nanocomposites with aluminum oxide.png)
Polymer
PolymerIF0
PREAI
分享收藏
分享收藏
查看更多内容