中国科学院理论物理研究所机构知识库
Advanced  
ITP OpenIR  > 理论物理所2011年知识产出  > 期刊论文
题名: A message-passing approach to random constraint satisfaction problems with growing domains
作者: Zhao, CY ;  Zhou, HJ ;  Zheng, ZM ;  Xu, K
刊名: JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT
出版日期: 2011
期号: *, 页码:P02019
关键词: EXACT PHASE-TRANSITIONS ;  RANDOM K-SAT ;  SATISFIABILITY ;  THRESHOLD ;  ALGORITHM
学科分类: Physics
通讯作者: Xu, K (reprint author), Beihang Univ, State Key Lab Software Dev Environm, Beijing 100191, Peoples R China.
部门归属: [Xu, Ke] Beihang Univ, State Key Lab Software Dev Environm, Beijing 100191, Peoples R China; [Zhao, Chunyan; Zheng, Zhiming] Beihang Univ, Sch Math & Syst Sci, Beijing 100191, Peoples R China; [Zhou, Haijun] Chinese Acad Sci, Inst Theoret Phys, Beijing 100190, Peoples R China; [Zhao, Chunyan; Zheng, Zhiming] Beihang Univ, LMIB, Beijing 100191, Peoples R China
英文摘要: Message-passing algorithms based on belief propagation (BP) are implemented on a random constraint satisfaction problem (CSP) referred to as model RB, which is a prototype of hard random CSPs with growing domain size. In model RB, the number of candidate discrete values (the domain size) of each variable increases polynomially with the variable number N of the problem formula. Although the satisfiability threshold of model RB is exactly known, finding solutions for a single problem formula is quite challenging and attempts have been limited to cases of N similar to 10(2). In this paper, we propose two different kinds of message-passing algorithms guided by BP for this problem. Numerical simulations demonstrate that these algorithms allow us to find a solution for random formulas of model RB with constraint tightness slightly less than p(cr), the threshold value for the satisfiability phase transition. To evaluate the performance of these algorithms, we also provide a local search algorithm (random walk) as a comparison. Besides this, the simulated time dependence of the problem size N and the entropy of the variables for growing domain size are discussed.
资助者: National Key Basic Research Project of China [200532CB1092]; NSFC [60473109, 60973033]
收录类别: SCI
原文出处: 查看原文
语种: 英语
WOS记录号: WOS:000287802800023
Citation statistics: 
内容类型: 期刊论文
URI标识: http://ir.itp.ac.cn/handle/311006/14422
Appears in Collections:理论物理所2011年知识产出_期刊论文

Files in This Item: Download All
File Name/ File Size Content Type Version Access License
A message-passing approach to random constraint satisfaction problems with growing domains.pdf(810KB)----开放获取View Download

Recommended Citation:
Zhao, CY,Zhou, HJ,Zheng, ZM,et al. A message-passing approach to random constraint satisfaction problems with growing domains[J]. JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT,2011(*):P02019.
Service
 Recommend this item
 Sava as my favorate item
 Show this item's statistics
 Export Endnote File
Google Scholar
 Similar articles in Google Scholar
 [Zhao, CY]'s Articles
 [Zhou, HJ]'s Articles
 [Zheng, ZM]'s Articles
CSDL cross search
 Similar articles in CSDL Cross Search
 [Zhao, CY]‘s Articles
 [Zhou, HJ]‘s Articles
 [Zheng, ZM]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
  Add to CiteULike  Add to Connotea  Add to Del.icio.us  Add to Digg  Add to Reddit 
文件名: A message-passing approach to random constraint satisfaction problems with growing domains.pdf
格式: Adobe PDF
此文件暂不支持浏览
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2017  中国科学院理论物理研究所 - Feedback
Powered by CSpace