CSpace  > 应用数学研究所
Performances of pure random walk algorithms on constraint satisfaction problems with growing domains
Xu, Wei1; Gong, Fuzhou2
2016-07-01
Source PublicationJOURNAL OF COMBINATORIAL OPTIMIZATION
ISSN1382-6905
Volume32Issue:1Pages:51-66
AbstractThe performances of two types of pure random walk (PRW) algorithms for a model of constraint satisfaction problem with growing domains (called Model RB) are investigated. Threshold phenomenons appear for both algorithms. In particular, when the constraint density is smaller than a threshold value , PRW algorithms can solve instances of Model RB efficiently, but when is bigger than the , they fail. Using a physical method, we find out the threshold values for both algorithms. When the number of variables is large, the threshold values tend to zero, so generally speaking PRW does not work on Model RB. By performing experiments, we show that PRW strategy cannot do better than other fundamental strategies.
KeywordConstraint satisfaction problems Model RB Random walk Local search algorithms
DOI10.1007/s10878-015-9891-9
Language英语
WOS Research AreaComputer Science ; Mathematics
WOS SubjectComputer Science, Interdisciplinary Applications ; Mathematics, Applied
WOS IDWOS:000379033200004
PublisherSPRINGER
Citation statistics
Cited Times:5[WOS]   [WOS Record]     [Related Records in WOS]
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/23092
Collection应用数学研究所
Affiliation1.Beihang Univ, Sch Math & Syst Sci, Beijing 100191, Peoples R China
2.Chinese Acad Sci, Acad Math & Syst Sci, Inst Appl Math, Beijing 100190, Peoples R China
Recommended Citation
GB/T 7714
Xu, Wei,Gong, Fuzhou. Performances of pure random walk algorithms on constraint satisfaction problems with growing domains[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION,2016,32(1):51-66.
APA Xu, Wei,&Gong, Fuzhou.(2016).Performances of pure random walk algorithms on constraint satisfaction problems with growing domains.JOURNAL OF COMBINATORIAL OPTIMIZATION,32(1),51-66.
MLA Xu, Wei,et al."Performances of pure random walk algorithms on constraint satisfaction problems with growing domains".JOURNAL OF COMBINATORIAL OPTIMIZATION 32.1(2016):51-66.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Xu, Wei]'s Articles
[Gong, Fuzhou]'s Articles
Baidu academic
Similar articles in Baidu academic
[Xu, Wei]'s Articles
[Gong, Fuzhou]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Xu, Wei]'s Articles
[Gong, Fuzhou]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

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