Hybrid backtracking bounded by tree-decomposition of constraint networks

Philippe Jegou; Cyril Terrioux

首页> 外文期刊>Artificial intelligence >Hybrid backtracking bounded by tree-decomposition of constraint networks

【24h】

Hybrid backtracking bounded by tree-decomposition of constraint networks

机译：受约束网络的树分解约束的混合回溯

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

We propose a framework for solving CSPs based both on backtracking techniques and on the notion of tree-decomposition of the constraint networks. This mixed approach permits us to define a new framework for the enumeration, which we expect that it will benefit from the advantages of two approaches: a practical efficiency of enumerative algorithms and a warranty of a limited time complexity by an approximation of the tree-width of the constraint networks. Finally, experimental results allow us to show the advantages of this approach.

机译：我们提出了一种基于回溯技术和约束网络的树分解概念来求解CSP的框架。这种混合方法允许我们定义一个新的枚举框架，我们希望它将受益于两种方法的优点：枚举算法的实际效率以及通过近似树宽来保证有限的时间复杂性约束网络。最后，实验结果使我们能够证明这种方法的优势。

著录项

来源
《Artificial intelligence》 |2003年第1期|p.43-75|共33页
作者
Philippe Jegou; Cyril Terrioux;
展开▼
作者单位

Laboratoire des Sciences de l'Information et des Systemes, LSIS-CNRS, Universite d'Aix-Marseille 3, Av. Escadrille Normandie-Niemen, 13397 Marseille Cedex 20, France;

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类自动化技术、计算机技术;
关键词
constraint networks; time-space; hybrid algorithms; tree-decomposition; empirical evaluation;

机译：约束网络时空混合算法树分解经验评估;

相似文献

外文文献
中文文献
专利

1. Interleaved backtracking in distributed constraint networks [J] . Youssef Hamadi International Journal of Artificial Intelligence Tools: Architectures, Languages, Algorithms . 2002,第2期

机译：分布式约束网络中的交错回溯
2. A hybrid backtracking search optimization algorithm for nonlinear optimal control problems with complex dynamic constraints [J] . Su Zikang, Wang Honglun, Yao Peng Neurocomputing . 2016,第apra19期

机译：具有复杂动态约束的非线性最优控制问题的混合回溯搜索优化算法
3. Hybrid on-demand greedy routing protocol with backtracking for mobile ad-hoc networks [J] . International journal of pervasive computing and communications . 2020,第1期

机译：用于移动自组织网络的具有回溯功能的混合按需贪婪路由协议
4. Tree-Decompositions with Connected Clusters for Solving Constraint Networks [C] . Philippe Jegou, Cyril Terrioux International conference on principles and practice of constraint programming . 2014

机译：带连接簇的树分解，用于求解约束网络
5. A hybrid approach for derivation of tight execution time bounds of program-segments and service time bounds of simple object methods in real-time distributed computing systems. [D] . Im, Chansik. 2005

机译：一种用于在实时分布式计算系统中推导程序段的严格执行时间界限和简单对象方法的服务时间界限的混合方法。
6. Bio-ModelChecker: Using Bounded Constraint Satisfaction to Seamlessly Integrate Observed Behavior With Prior Knowledge of Biological Networks [O] . Hooman Sedghamiz, Matthew Morris, Travis J. A Craddock, 2019

机译：Bio-ModelChecker：使用有限约束满意度将观察到的行为与生物网络的先验知识无缝整合
7. Hybrid backtracking bounded by tree-decomposition of constraint networks [O] . Jégou Philippe, Terrioux Cyril 2003

机译：受约束网络的树分解约束的混合回溯

Hybrid backtracking bounded by tree-decomposition of constraint networks

摘要

著录项

相似文献

相关主题

期刊订阅