.png){kind=icon}
返回
A non-binary constraint ordering heuristic for constraint satisfaction problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2007.08.064.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Nowadays many real problems can be modelled as constraint satisfaction problems (CSPs). A search algorithm for constraint programming requires an order in which variables and values should to be considered. Choosing the right order of variables and values can noticeably improve the efficiency of constraint satisfaction. Furthermore, the order in which constraints are studied can improve efficiency, particularly in problems with non-binary constraints. In this paper, we present a preprocess heuristic called constraint ordering heuristic (COH) that studies the constrainedness of the scheduling problem and mainly classifies the constraints so that the tightest ones are studied first. Thus, constrainedness can be known in advance and overall inconsistencies can be found earlier and the number of constraint checks can significantly be reduced. (C) 2007 Elsevier Inc. All rights reserved.
Keyword:
heuristic search
constraint ordering
non-binary constraints
constrainedness
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏Comparative Study of Speenhamland of England, Family Assistance Plan of USA, and National Basic Livelihood Security Program of Korea英国斯宾汉姆兰制度、美国家庭援助计划与韩国国家基本生计保障计划的比较研究
OAAI
OAAI分享收藏
查看更多内容