Hybrid backtracking bounded by tree-decomposition of constraint networks-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Hybrid backtracking bounded by tree-decomposition of constraint networks

Published:2003-05 Issue:1 Volume:146 Page:43-75
ISSN:0004-3702
Container-title:Artificial Intelligence
language:en
Short-container-title:Artificial Intelligence

Author:

Jégou Philippe,Terrioux Cyril

Publisher

Elsevier BV

Subject

Artificial Intelligence,Linguistics and Language,Language and Linguistics

Reference36 articles.

1. Complexity of finding embedding in a k-tree;Arnborg;SIAM J. Discrete Math.,1987

2. A wide-range efficient algorithm for minimal triangulation;Berry,1999

3. A sufficiently fast algorithm for finding close to optimal clique trees;Becker;Artificial Intelligence,2001

4. An optimal backtrack algorithm for tree-structured constraint satisfaction problems;Bayardo;Artificial Intelligence,1994

5. A complexity analysis of space-bounded learning algorithms for the constraints satisfaction problem;Bayardo,1996

Cited by 66 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Variable Neighborhood Search for Cost Function Networks;Handbook of Formal Optimization;2024

2. Computing partial hypergraphs of bounded width;Discrete Applied Mathematics;2023-04

3. Variable Neighborhood Search for Cost Function Networks;Handbook of Formal Optimization;2023

4. On Learning When to Decompose Graphical Models;Lecture Notes in Computer Science;2023

5. Correlating the Community Structure of Constraint Satisfaction Problems with Search Time;International Journal on Artificial Intelligence Tools;2022-11

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP