ML Anthology

Pseudo-Tree Construction Heuristics for DCOPs with Variable Communication Times

Atena M. Tabakhi
AAAI 2016 pp. 4238-4239
doi:10.1609/AAAI.V30I1.9948 /aaai/2016/tabakhi2016aaai-pseudo/

Abstract

Empirical evaluations of DCOP algorithms are typically done in simulation and under the assumption that the communication times between all pairs of agents are identical, which is unrealistic in many real-world applications. In this abstract, we incorporate non-uniform communication times in the default DCOP model and propose heuristics that exploit these communication times to speed up DCOP algorithms that operate on pseudo-trees.

PDF AAAI Semantic Scholar

Cite

Text

Tabakhi. "Pseudo-Tree Construction Heuristics for DCOPs with Variable Communication Times." AAAI Conference on Artificial Intelligence, 2016. doi:10.1609/AAAI.V30I1.9948

Markdown

[Tabakhi. "Pseudo-Tree Construction Heuristics for DCOPs with Variable Communication Times." AAAI Conference on Artificial Intelligence, 2016.](https://mlanthology.org/aaai/2016/tabakhi2016aaai-pseudo/) doi:10.1609/AAAI.V30I1.9948

BibTeX

@inproceedings{tabakhi2016aaai-pseudo,
  title     = {{Pseudo-Tree Construction Heuristics for DCOPs with Variable Communication Times}},
  author    = {Tabakhi, Atena M.},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2016},
  pages     = {4238-4239},
  doi       = {10.1609/AAAI.V30I1.9948},
  url       = {https://mlanthology.org/aaai/2016/tabakhi2016aaai-pseudo/}
}