{"type":"ScholarlyArticle","title":"Generalizing ADOPT and BnB-ADOPT","authors":[{"name":"Patricia Gutierrez","slug":"patricia-gutierrez","given":"Patricia","family":"Gutierrez","affiliation":""},{"name":"Pedro Meseguer","slug":"pedro-meseguer","given":"Pedro","family":"Meseguer","affiliation":""},{"name":"William Yeoh","slug":"william-yeoh","given":"William","family":"Yeoh","affiliation":""}],"abstract":"ADOPT and BnB-ADOPT are two optimal DCOP search algorithms that are similar except for their search strategies: the former uses best-first search and the latter uses depth-first branch-and-bound search. In this paper, we present a new algorithm, called ADOPT(k), that generalizes them. Its behavior depends on the k parameter. It behaves like ADOPT when k = 1, like BnB-ADOPT when k = ∞ and like a hybrid of ADOPT and BnB-ADOPT when 1 < k < ∞. We prove that ADOPT(k) is a correct and complete algorithm and experimentally show that ADOPT(k) outperforms ADOPT and BnB-ADOPT on several benchmarks across several metrics.","doi":"10.5591/978-1-57735-516-8/IJCAI11-100","url":"https://ijcai.org/proceedings/2011/100","pdf":"https://ijcai.org/proceedings/2011/0100.pdf","markdown":"https://ijcai.org/proceedings/2011/100.md","bibtex":"https://ijcai.org/proceedings/2011/bibtex/100","volume":{"slug":"2011","title":"Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2011","url":"https://ijcai.org/proceedings/2011/","year":2011,"location":"Barcelona, Catalonia, Spain","dates":"16–22 July 2011","editors":"Toby Walsh","isbn":"978-1-57735-512-0; 978-1-57735-513-7; 978-1-57735-514-4; 978-1-57735-515-1; 978-1-57735-516-8","publisher":"AAAI Press/International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":100,"pages":{"first":554,"last":558},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}