Caching in Backtracking Search - University of Toronto.pptVIP

下载本文档

8
0
约3.15万字
约 83页
2016-03-12 发布于广东
举报
版权申诉

Caching in Backtracking Search - University of Toronto.ppt

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

Caching in Backtracking Search - University of Toronto.ppt

* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * Branch Decomposition Fahiem Bacchus, University of Toronto * * Start with m leaf nodes one for each of the local functions. Map each local function to some leaf node. f3 f6 f1 f4 f2 f7 f5 Branch Decomposition Fahiem Bacchus, University of Toronto * * V4, V5 V5,V6,V7 V3,V7 V1,V3 V4,V6 V8,V6 V5, V2 Label each leaf node with the variables in the scope of the associated local function. f3 f6 f1 f4 f2 f7 f5 Branch Decomposition Fahiem Bacchus, University of Toronto * * V4, V5 V5,V6,V7 V3,V7 V1,V3 V4,V6 V8,V6 V5, V2 Build a binary tree on top of these nodes. V4,V6,V3 Branch Decomposition Fahiem Bacchus, University of Toronto * * V4, V5 V5,V6,V7 V3,V7 V1,V3 V4,V6 V8,V6 V5, V2 Then label the rest of the nodes of the tree. V5,V6,V3 V4, V5 V3,V4,V6 V4,V6,V3 Internal Labels Fahiem Bacchus, University of Toronto * * B B variables in the rest of the tree. (Not in subtree under the node) A B A variables in the subtree below Internal Labels Fahiem Bacchus, University of Toronto * * A ? B v v Branch Width Width of a particular decomposition is the size of the minimal label. Branch width is the minimal width over all possible branch decompositions. Branch width is no more than the tree-width. Fahiem Bacchus, University of Toronto * * Algorithms: Dynamic Programming Bottom up Dynamic Programming, e.g., Join Tree algorithms in Bayesian Inference Fahiem Bacchus, University of Toronto * * V4,V6,V3 V4, V5 V3,V7 V1,V3 V4,V6 V8,V6 V5, V2 V5,V6,V3 V4, V5 V3,V4,V6 V4,V6,V3 V5,V6,V7 Algorithms: Variable Elimination Linearize the bottom up process: Variable Elimination. Fahiem Bacchus, University of Toronto * * V4,V6,V3 V4, V5 V3,V7 V1,V3 V4,V6 V8,V6 V5, V2 V5,V6,V3 V4, V5 V3,V4,V6 V4,V6,V3 V5,V6,V7 Algorithms: Instantiation and Decomposition Instantiate variables starting at the top (V4, V6 and V3) and decompose the problem. Fahiem