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

相似書籍