H-DPOP: Using Hard Constraints for Search Space Pruning in DCOP
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together in fewer messages, which produce much less networking overhead than search. Nevertheless, these messages are exponential i...
Saved in:
Main Authors: | KUMAR, Akshat, PETCU, Adrian, FALTINGS, Boi |
---|---|
格式: | text |
語言: | English |
出版: |
Institutional Knowledge at Singapore Management University
2008
|
主題: | |
在線閱讀: | https://ink.library.smu.edu.sg/sis_research/2215 https://ink.library.smu.edu.sg/context/sis_research/article/3215/viewcontent/H_DPOP__Using_Hard_Constraints_for_Search_Space_Pruning_in_DCOP.pdf |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Singapore Management University |
語言: | English |
相似書籍
-
Distributed Constraint Optimization with Structured Resource Constraints
由: KUMAR, Akshat, et al.
出版: (2009) -
Incremental DCOP Search Algorithms for Solving Dynamic DCOP Problems
由: YEOH, William, et al.
出版: (2011) -
Caching Schemes for DCOP Search Algorithms
由: YEOH, William, et al.
出版: (2009) -
Probabilistic Inference Based Message-Passing for Resource Constrained DCOPs
由: GHOSH, Supriyo, et al.
出版: (2015) -
Decentralized multi-agent reinforcement learning in average-reward dynamic DCOPs
由: Nguyen, Duc Thien, et al.
出版: (2014)