组合景观中问题结构的开发--以纯数学应用为例
Exploiting Problem Structure in Combinatorial Landscapes: A Case Study on Pure Mathematics Application
摘要：
在本文中，我们提出了一种方法，使用人工智能技术来解决的情况下，纯数学应用寻找窄容许元组。将原问题转化为一个组合优化问题。特别是，我们将展示如何利用本地搜索结构制定的问题景观搜索空间的显着减少和非平凡的消除搜索障碍，然后实现智能搜索策略有效地逃离局部极小值。实验结果表明，该方法能够有效地找到最佳已知的解决方案。这项研究揭示了利用局部问题结构在组合景观中进行有效搜索，作为AI在新问题领域的应用。
英文摘要：
In this paper, we present a method using AI techniques to solve a case of pure mathematics applications for finding narrow admissible tuples. The original problem is formulated into a combinatorial optimization problem. In particular, we show how to exploit the local search structure to formulate the problem landscape for dramatic reductions in search space and for non-trivial elimination in search barriers, and then to realize intelligent search strategies for effectively escaping from local minima. Experimental results demonstrate that the proposed method is able to efficiently find best known solutions. This research sheds light on exploiting the local problem structure for an efficient search in combinatorial landscapes as an application of AI to a new problem domain.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
