Visualization for Structured Constraint Satisfaction Problems
Visualization for Structured Constraint Satisfaction Problems
复制标题
结构化约束满足问题的可视化
DOI：
--
复制
发表时间：
2010
期刊：
影响因子：
--
通讯作者：
Susan L. Epstein
中科院分区：
文献类型：
--
作者：
Xingjian Li;Susan L. Epstein
约束满足问题是现实世界问题的数学模型。与随机生成的人工问题相比，现实世界的问题通常具有非随机结构。如果事先确定了这种结构，就可以使搜索更有效地找到解决方案。本文介绍了DrawCSP，一个可视化程序，可以显示原始的和发现的约束满足问题的结构。DrawCSP提供了对搜索算法设计和现实问题挑战的深入了解。
Constraint satisfaction problems are mathematical models of real-world problems. In contrast to randomly generated artificial problems, real-world problems usually have nonrandom structure. Knowledge about that structure, when identified in advance, can make search to find solutions more effective. This paper introduces DrawCSP, a visualization program that can show both the original and the discovered structure of constraint satisfaction problems. DrawCSP provides insight into both search algorithm design and into the challenges real-world problems present.