IDEAS home Printed from https://ideas.repec.org/a/ids/ijidsc/v6y2014i2p127-152.html
   My bibliography  Save this article

Distributed constraint satisfaction with multiply sectioned constraint networks

Author

Listed:
  • Yang Xiang
  • Younis Mohamed
  • Wanling Zhang

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.

Suggested Citation

  • Yang Xiang & Younis Mohamed & Wanling Zhang, 2014. "Distributed constraint satisfaction with multiply sectioned constraint networks," International Journal of Information and Decision Sciences, Inderscience Enterprises Ltd, vol. 6(2), pages 127-152.
    • Handle: RePEc:ids:ijidsc:v:6:y:2014:i:2:p:127-152
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=61771
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijidsc:v:6:y:2014:i:2:p:127-152. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=306 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.