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

A Proposed Framework to Investigate the User Acceptance of Personal Health Records in Malaysia using UTAUT2 and PMT

Personal Health Records (PHRs) can be considered as one of the most important health technologies. PHRs enroll the patients directly to their health decision making through giving them the authority to control and share...

Reliability and Connectivity Analysis of Vehicluar Ad Hoc Networks for a Highway Tunnel

Vehicular ad-hoc network (VANET) uses ‘mobile internet’ to facilitate the communication between vehicles and with the goal to ensure road safety and achieve secure communication. Thus the reliability of this type of netw...

Reverse Engineering State and Strategy Design Patterns using Static Code Analysis

This paper presents an approach to detect behavioral design patterns from source code using static analysis techniques. It depends on the concept of Code Property Graph and enriching graph with relationships and properti...

Protection of Ultrasound Image Sequence: Employing Motion Vector Reversible Watermarking

In healthcare information systems, medical data is very important for diagnosis. Most of the health institutions store their patients’ data on third-party servers. Therefore, its security is very important, since the adv...

FF-MAC : Fast Forward IEEE 802.15.4 MAC Protocol for Real-Time Data Transmission

This paper presents a Fast Forward MAC layer designed for hard real-time applications in wireless sensor networks. This protocol is an enhancement to the IEEE 802.15.4 standard MAC layer proposed for Low-Rate Personal Ar...

Download PDF file
  • EP ID EP135716
  • DOI 10.14569/IJACSA.2013.040240
  • Views 71
  • 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