.png){kind=icon}
返回
Accelerating filtering techniques for numeric CSPs
.png){kind=icon}
OA
AI
DOI：10.1016/S0004-3702(02)00194-7.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Search algorithms for solving Numeric CSPs (Constraint Satisfaction Problems) make an extensive use of filtering techniques. In this paper(1) we show how those filtering techniques can be accelerated by discovering and exploiting some regularities during the filtering process. Two kinds of regularities are discussed, cyclic phenomena in the propagation queue and numeric regularities of the domains of the variables. We also present in this paper an attempt to unify numeric CSPs solving methods from two distinct communities, that of CSP in artificial intelligence, and that of interval analysis. (C) 2002 Elsevier Science B.V. All rights reserved.
Keyword:
numeric constraint satisfaction problem
filtering techniques
propagation
pruning
acceleration methods
nonlinear equations
interval arithmetic
interval analysis
strong consistency
extrapolation methods
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.9
论文数:
6.1K
被引数:
1.9W
机构
暂无机构信息
引用论文
.png){kind=icon}
查看更多内容