基于约束的局部搜索的顺序和并行重启策略

2013 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum Pub Date : 2013-05-20 DOI:10.1109/IPDPSW.2013.211

Y. Caniou, P. Codognet

{"title":"基于约束的局部搜索的顺序和并行重启策略","authors":"Y. Caniou, P. Codognet","doi":"10.1109/IPDPSW.2013.211","DOIUrl":null,"url":null,"abstract":"We study in this paper the influence of the restart policy on the sequential and parallel performance of combinatorial search problems. Our evaluation relies on several experiments using a constraint-based local search method, named Adaptive Search, and a few combinatorial problems such as Magic Square and Costas Array Problems.","PeriodicalId":234552,"journal":{"name":"2013 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Sequential and Parallel Restart Policies for Constraint-Based Local Search\",\"authors\":\"Y. Caniou, P. Codognet\",\"doi\":\"10.1109/IPDPSW.2013.211\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study in this paper the influence of the restart policy on the sequential and parallel performance of combinatorial search problems. Our evaluation relies on several experiments using a constraint-based local search method, named Adaptive Search, and a few combinatorial problems such as Magic Square and Costas Array Problems.\",\"PeriodicalId\":234552,\"journal\":{\"name\":\"2013 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-05-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IPDPSW.2013.211\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPDPSW.2013.211","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

本文研究了重启策略对组合搜索问题的顺序和并行性能的影响。我们的评估依赖于几个实验，使用了一种基于约束的局部搜索方法，称为自适应搜索，以及一些组合问题，如Magic Square和Costas Array问题。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Sequential and Parallel Restart Policies for Constraint-Based Local Search

We study in this paper the influence of the restart policy on the sequential and parallel performance of combinatorial search problems. Our evaluation relies on several experiments using a constraint-based local search method, named Adaptive Search, and a few combinatorial problems such as Magic Square and Costas Array Problems.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2013 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum

自引率

0.00%

发文量