H-DPOP: Using Hard Constraints for Search Space Pruning in DCOP

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...

Full description

Saved in:
Bibliographic Details
Main Authors: KUMAR, Akshat, PETCU, Adrian, FALTINGS, Boi
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2008
Subjects:
Artificial Intelligence and Robotics
Computer Sciences
Online Access: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
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/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

Similar Items