Phase transitions and coarse-grained search

C. Williams, T. Hogg
{"title":"Phase transitions and coarse-grained search","authors":"C. Williams, T. Hogg","doi":"10.1109/PHYCMP.1994.363680","DOIUrl":null,"url":null,"abstract":"Abstraction is a method for solving a variety of computational search problems that uses coarse-graining to simplify the search. When a coarse-grained, or abstract, solution is found, it is then refined to give a complete solution. We present a model of this abstraction process for constraint satisfaction problems, a well-known class of NP-complete search problems. This model is then used to identify phase transition-like behavior in the effectiveness of abstraction, as well as to determine the type of abstraction that is likely to be most useful for relatively hard instances of these search problems.<<ETX>>","PeriodicalId":378733,"journal":{"name":"Proceedings Workshop on Physics and Computation. PhysComp '94","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Workshop on Physics and Computation. PhysComp '94","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PHYCMP.1994.363680","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Abstraction is a method for solving a variety of computational search problems that uses coarse-graining to simplify the search. When a coarse-grained, or abstract, solution is found, it is then refined to give a complete solution. We present a model of this abstraction process for constraint satisfaction problems, a well-known class of NP-complete search problems. This model is then used to identify phase transition-like behavior in the effectiveness of abstraction, as well as to determine the type of abstraction that is likely to be most useful for relatively hard instances of these search problems.<>
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
相变和粗粒度搜索
抽象是一种解决各种计算搜索问题的方法,它使用粗粒度来简化搜索。当找到一个粗粒度或抽象的解决方案时,然后将其细化为完整的解决方案。我们提出了约束满足问题的抽象过程模型,这是一类著名的np完全搜索问题。然后,该模型用于识别抽象有效性中的类似相变的行为,以及确定对于这些搜索问题的相对困难实例可能最有用的抽象类型。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Thermal logic circuits The complexity and entropy of Turing machines Statistical mechanics of combinatorial search Encoded arithmetic for reversible logic Quantum cellular automata: the physics of computing with arrays of quantum dot molecules
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1