DocumentCode :
1809558
Title :
Dynamic Variable Ordering Based Concurrent Search for Distributed CSPs
Author :
Liu, Chunhui ; Sun, Jigui ; Gao, Jian
Author_Institution :
Jilin Univ., Changchun
fYear :
2007
fDate :
18-21 Sept. 2007
Firstpage :
947
Lastpage :
952
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.
Keywords :
distributed processing; search problems; concurrent search; distributed CSP; distributed constraint satisfaction problems; distributed dynamic variable ordering; dynamic variable ordering; Computer networks; Computer science; Computer science education; Concurrent computing; Distributed computing; Educational institutions; Educational technology; Knowledge engineering; Laboratories; Parallel processing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Network and Parallel Computing Workshops, 2007. NPC Workshops. IFIP International Conference on
Conference_Location :
Liaoning
Print_ISBN :
978-0-7695-2943-1
Type :
conf
DOI :
10.1109/NPC.2007.146
Filename :
4351608
Link To Document :
بازگشت