Algorithm Selection for Constraint Optimization Domains

Abstract

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.

Authors and Affiliations

Avi Rosenfeld

Keywords

Related Articles

Surface Texture Synthesis and Mixing Using Differential Colors

In neighborhood-based texture synthesis, adjacent local regions need to satisfy color continuity constraints in order to avoid visible seams. Such continuity constraints seriously restrict the variability of synthesized...

Improvement in Classification Algorithms through Model Stacking with the Consideration of their Correlation

In this research we analyzed the performance of some well-known classification algorithms in terms of their accuracy and proposed a methodology for model stacking on the basis of their correlation which improves the accu...

A New Algorithm for Balancing Group Population in Collaborative Leaning Sessions

Proper group formation is essential in conducting a productive collaborative learning session. It specifies the internal structure that the collaborating groups should have based on roles. The Group formation is a dynami...

Automatic Facial Feature Extraction and Expression Recognition based on Neural Network

In this paper, an approach to the problem of automatic facial feature extraction from a still frontal posed image and classification and recognition of facial expression and hence emotion and mood of a person is present...

BAAC: Bangor Arabic Annotated Corpus

This paper describes the creation of the new Bangor Arabic Annotated Corpus (BAAC) which is a Modern Standard Arabic (MSA) corpus that comprises 50K words manually annotated by parts-of-speech. For evaluating the quality...

Download PDF file
  • EP ID EP135716
  • DOI 10.14569/IJACSA.2013.040240
  • Views 104
  • Downloads 0

How To Cite

Avi Rosenfeld (2013). Algorithm Selection for Constraint Optimization Domains. International Journal of Advanced Computer Science & Applications, 4(2), 267-274. https://europub.co.uk/articles/-A-135716