文章基本信息

标题：Algorithm Selection for Constraint Optimization Domains
本地全文：下载
作者：Avi Rosenfeld
期刊名称：International Journal of Advanced Computer Science and Applications(IJACSA)
印刷版ISSN：2158-107X
电子版ISSN：2156-5570
出版年度：2013
卷号：4
期号：2
DOI：10.14569/IJACSA.2013.040240
出版社：Science and Information Society (SAI)
摘要：In this paper we investigate methods for selecting the best algorithms in classic distributed constraint optimization problems. While these are NP-complete problems, many heuristics have nonetheless been proposed. We found that the best method to use can change radically based on the specifics of a given problem instance. Thus, dynamic methods are needed that can choose the best approach for a given problem. We found that large differences typically exist in the expected utility between algorithms, allowing for a clear policy. We present a dynamic algorithm selection approach based on this realization. As support for this approach, we describe the results from thousands of trials from Distributed Constraint Optimization problems that demonstrates the strong statistical improvement of this dynamic approach over the static methods they are based on.
关键词：thesai; IJACSA; thesai.org; journal; IJACSA papers