Main content

Distributed Constraint Satisfaction with Multiply Sectioned Constraint Networks

Show simple item record Xiang, Yang Mohamed, Younis Zhang, Wanling 2015-06-19T19:23:21Z 2015-06-19T19:23:21Z 2014
dc.identifier.issn 1756-7017
dc.description Journal webpage: en_US
dc.description.abstract We propose a new algorithmic framework, multiply sectioned constraint networks (MSCNs), for solving distributed constraint satisfaction problems (DisCSPs) with complex local problems. An MSCN is converted into a linked junction forest (LJF) and is solved by a complete algorithm. Its time complexity is linear on the number and size of local problems (each in charge by an agent) and is exponential on cluster size of LJF. We show that the MSCN-LJF algorithm is more efficient than junction tree-based DisCSP algorithms. When a DisCSP is not naturally an MSCN, we show how to convert it into an MSCN, so that any DisCSP can be solved as above. en_US
dc.description.sponsorship NSERC, Canada en_US
dc.language.iso en en_US
dc.publisher Inderscience en_US
dc.subject Distributed constraint satisfaction problems, multiply sectioned constraint networks, linked junction forests, complex local problems, multiagent systems, junction trees. en_US
dc.title Distributed Constraint Satisfaction with Multiply Sectioned Constraint Networks en_US
dc.type Article en_US
dc.rights.license All items in the Atrium are protected by copyright with all rights reserved unless otherwise indicated.
dcterms.relation Y. Xiang, Y. Mohamed, and W. Zhang, Distributed Constraint Satisfaction with Multiply Sectioned Constraint Networks. International Journal of Information and Decision Sciences, Vol.6, No.2, 127-152, 2014.

Files in this item

Files Size Format View Description
ijids13.pdf 202.0Kb PDF View/Open Main article

This item appears in the following Collection(s)

Show simple item record