ppt课件-2x2chessboard,2pieces,2steps- intelligent optimization（2 x2chessboard,2件,2 -智能优化的步骤）.pptVIP

下载本文档

3
0
约2.53万字
约 66页
2017-01-25 发布于四川
举报
版权申诉

ppt课件-2x2chessboard,2pieces,2steps- intelligent optimization（2 x2chessboard,2件,2 -智能优化的步骤）.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文档。上传文档

April 7, 2008 Probabilistic Techniques for Combinatorial Problems Satisfied by Message Passing: Probabilistic Techniques for Combinatorial Problems Lukas Kroc, Ashish Sabharwal, Bart Selman Cornell University LION 3 Tutorial January 17, 2009 What is the Tutorial all about? How can we use ideas from probabilistic reasoning to solve hard combinatorial problems? Why the Tutorial? A very active, multi-disciplinary research area Involves amazing statistical physicists who have been solving a central problem in CS and AI: constraint satisfaction They have brought in unusual techniques (unusual from the CS view) to solve certain hard problems with unprecedented efficiency Unfortunately, can be hard to follow: they speak a different language Success story Survey Propagation (SP) can solve 1,000,000+ variable problems in a few minutes on a desktop computer (demo later) The best “pure CS” techniques scale to only 100s to ~1,000s of variables Beautiful insights into the structure of the space of solutions Ways of using the structure for faster solutions Tutorial Outline Introduction Success story: Survey Propagation Solution clusters Probabilistic inference forclusters Constraint Satisfaction Problem (CSP) Constraint Satisfaction Problem P: Input: a set V of variables a set of corresponding domains of variable values [discrete, finite] a set of constraints on V [constraint ? set of allowed value tuples] Output: a solution, valuation of variables that satisfies all constraints Example: a jigsaw puzzle Squares = variables Pieces = domain Matching edges = constraints Full picture = solution Well Known CSPs: k-SAT: Boolean satisfiability Domains: {0,1} or {true, false} Constraints: disjunctions of variables or their negations (“clauses”) with exactly k variables each NP complete for k?3 k-COL: Graph coloring Variables: nodes of a given graph Domains: colors 1…k Constraints: no two adjacent nodes get the same color. NP complete for k?3 Solv