首页> 外文会议>PRICAI 2008: Trends in Artificial Intelligence >Branch and Bound Algorithms to Solve Semiring Constraint Satisfaction Problems
【24h】

Branch and Bound Algorithms to Solve Semiring Constraint Satisfaction Problems

机译:求解半圆约束满足问题的分支定界算法

获取原文
获取原文并翻译 | 示例

摘要

The Semiring Constraint Satisfaction Problem (SCSP) framework is a, popular approach for the representation of partial constraint satisfaction problems. Considerable research has been done in solving SCSPs, but limited work has been done in building general SCSP solvers. This paper is part of a series in which incremental changes are made to a branch and bound (BnB) algorithm for solving SCSPs. We present two variants of a BnB algorithm: a backjumping algorithm and a forward checking algorithm. These algorithms are based on the maximal constraints algorithms of Freuder and Wallace [1], and we show they perform better than the BnB algorithm on some problem instances.
机译:半环约束满足问题(SCSP)框架是表示部分约束满足问题的一种流行方法。在解决SCSP方面已经进行了大量研究,但是在构建通用SCSP求解器方面所做的工作有限。本文是该系列的一部分,其中对解决SCSP的分支定界(BnB)算法进行了增量更改。我们提出了BnB算法的两个变体:回跳算法和前向检查算法。这些算法基于Freuder和Wallace [1]的最大约束算法,我们证明它们在某些问题实例上的性能优于BnB算法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号