Distributed Gibbs: A memory-bounded sampling-based DCOP algorithm

Distributed Gibbs: A memory-bounded sampling-based DCOP algorithm

Researchers have used distributed constraint optimization problems (DCOPs) to model various multi-agent coordination and resource allocation problems. Very recently, Ottens et al. proposed a promising new approach to solve DCOPs that is based on confidence bounds via their Distributed UCT (DUCT) sam...

Full description

Saved in:
Bibliographic Details
Main Authors: NGUYEN, Duc Thien, YEOH, William, LAU, Hoong Chuin
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2013
Subjects:
DCOP
Sampling
Gibbs
Artificial Intelligence and Robotics
Operations Research, Systems Engineering and Industrial Engineering
Online Access:https://ink.library.smu.edu.sg/sis_research/1656
https://ink.library.smu.edu.sg/context/sis_research/article/2655/viewcontent/aamas13_dgibbs.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English

Internet

https://ink.library.smu.edu.sg/sis_research/1656
https://ink.library.smu.edu.sg/context/sis_research/article/2655/viewcontent/aamas13_dgibbs.pdf

Similar Items