基于动态变量排序的分布式csp并发搜索

2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007) Pub Date : 2007-09-18 DOI:10.1109/NPC.2007.146

Chun-Hui Liu, Jigui Sun, Man Gao

{"title":"基于动态变量排序的分布式csp并发搜索","authors":"Chun-Hui Liu, Jigui Sun, Man Gao","doi":"10.1109/NPC.2007.146","DOIUrl":null,"url":null,"abstract":"Concurrent search is an efficient technique for solving distributed constraint satisfaction problems (DisCSPs). dynamic variable ordering (DVO) impacts performance of search greatly. In this paper, we present a distributed dynamic variable ordering based concurrent search algorithm, in which domain sizes of variables are calculated approximately during search. Experiments on randomly generated DisCSPs demonstrate that the proposed algorithm improves concurrent search drastically.","PeriodicalId":278518,"journal":{"name":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","volume":"344 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Dynamic Variable Ordering Based Concurrent Search for Distributed CSPs\",\"authors\":\"Chun-Hui Liu, Jigui Sun, Man Gao\",\"doi\":\"10.1109/NPC.2007.146\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Concurrent search is an efficient technique for solving distributed constraint satisfaction problems (DisCSPs). dynamic variable ordering (DVO) impacts performance of search greatly. In this paper, we present a distributed dynamic variable ordering based concurrent search algorithm, in which domain sizes of variables are calculated approximately during search. Experiments on randomly generated DisCSPs demonstrate that the proposed algorithm improves concurrent search drastically.\",\"PeriodicalId\":278518,\"journal\":{\"name\":\"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)\",\"volume\":\"344 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-09-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NPC.2007.146\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NPC.2007.146","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

并发搜索是求解分布式约束满足问题的一种有效方法。动态变量排序(DVO)对搜索性能影响很大。本文提出了一种基于分布式动态变量排序的并发搜索算法，该算法在搜索过程中近似计算变量的域大小。在随机生成的discsp上的实验表明，该算法显著改善了并发搜索。

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

查看原文本刊更多论文

Dynamic Variable Ordering Based Concurrent Search for Distributed CSPs

Concurrent search is an efficient technique for solving distributed constraint satisfaction problems (DisCSPs). dynamic variable ordering (DVO) impacts performance of search greatly. In this paper, we present a distributed dynamic variable ordering based concurrent search algorithm, in which domain sizes of variables are calculated approximately during search. Experiments on randomly generated DisCSPs demonstrate that the proposed algorithm improves concurrent search drastically.

求助全文

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

来源期刊

2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007)

自引率

0.00%

发文量