Asynchronous breadth-first search DCOP algorithm

MaRDI QIDQ3599332zbMATH OpenFDO

Authors Redouane Ezzahir, Christian Bessiere, Imade Benelallam, El H. Bouyakhf, Mustapha Belaissaoui

Publication date 3 February 2009

Full work available at URL http://www.m-hikari.com/ams/ams-password-2008/ams-password37-40-2008/ezzahirAMS37-40-2008.pdf

zbMATH Keywords

AFB with backjumpingdistributed constraint optimization problemsmulti-agents system

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• scientific article; zbMATH DE number 5547971
• BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm
• IDB-ADOPT: A Depth-First Search DCOP Algorithm
• Concurrent forward bounding for distributed constraint optimization problems
• Adopt: asynchronous distributed constraint optimization with quality guarantees

Cited in

(3)

• Adopt: asynchronous distributed constraint optimization with quality guarantees
• BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm
• IDB-ADOPT: A Depth-First Search DCOP Algorithm

This page was built for publication: Asynchronous breadth-first search DCOP algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3599332)