A hybrid tree-based algorithm to solve asymmetric distributed constraint optimization problems

Asymmetric distributed constraint optimization problems (ADCOPs) have emerged as an important formalism in multi-agent community due to their ability to capture personal preferences. However, the existing search-based complete algorithms for ADCOPs only exploit local knowledge to calculate lower bou...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Autonomous agents and multi-agent systems Jg. 34; H. 2
Hauptverfasser:	Chen, Dingding, Deng, Yanchen, Chen, Ziyu, He, Zhongshi, Zhang, Wenxin
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.10.2020 Springer Nature B.V
Schlagworte:	Algorithms Artificial Intelligence Computer Science Computer Systems Organization and Communication Networks Inference Lower bounds Mathematical analysis Multiagent systems Optimization Privacy Search algorithms Software Engineering/Programming and Operating Systems Upper bounds User Interfaces and Human Computer Interaction Inference ADCOP Complete ADCOP algorithm Search DCOP
ISSN:	1387-2532, 1573-7454
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!