【24h】

A New Algorithm for Maintaining Arc Consistency After Constraint Retraction

机译:约束回缩后保持电弧一致性的新算法

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

摘要

Dynamic Constraint Satisfaction Problems play a very important role in modeling and solving real-life problems where the set of constraints is changing. The paper addresses a problem of maintaining arc consistency after removing a constraint from the constraint model. A new dynamic arc consistency algorithm is proposed that improves the practical time efficiency of the existing AC|DC algorithm by using additional data-structures. The algorithm achieves real time efficiency close to the so far fastest DynAC-6 algorithm while keeping the memory consumption low.
机译:动态约束满意度问题在建模和解决约束条件不断变化的现实问题中扮演着非常重要的角色。本文解决了从约束模型中删除约束后保持弧线一致性的问题。提出了一种新的动态电弧一致性算法,该算法通过使用其他数据结构来提高现有AC | DC算法的实际时间效率。该算法的实时效率接近迄今为止最快的DynAC-6算法,同时保持较低的内存消耗。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号