Effect of DisCSP variable-ordering heuristics in scale-free networks

Tenda Okimoto, Atsushi Iwasaki, Makoto Yokoo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

A Distributed Constraint Satisfaction Problem (DisCSP) is a constraint satisfaction problem in which variables and constraints are distributed among multiple agents. Various algorithms for solving DisC-SPs have been developed, which are intended for general purposes, i.e., they can be applied to any network structure. However, if a network has some particular structure, e.g., the network structure is scale-free, we can expect that some specialized algorithms or heuristics, which are tuned for the network structure, can outperform general purpose algorithms/heuristics. In this paper, as an initial step toward developing specialized algorithms for particular network structures, we examine variable-ordering heuristics in scale-free networks. We use the classic asynchronous backtracking algorithm as a baseline algorithm and examine the effect of variable-ordering heuristics. First, we show that the choice of variable-ordering heuristics is more influential in scale-free networks than in random networks. Furthermore, we develop a novel variable-ordering heuristic that is specialized to scale-free networks. Experimental results illustrate that our new variable-ordering heuristic is more effective than a standard degree-based variable-ordering heuristic. Our proposed heuristic reduces the required cycles by 30% at the critical point.

Original languageEnglish
Title of host publicationPrinciples and Practice of Multi-Agent Systems - 13th International Conference, PRIMA 2010, Revised Selected Papers
Pages166-180
Number of pages15
DOIs
Publication statusPublished - Dec 1 2012
Event13th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2010 - Kolkata, India
Duration: Nov 12 2010Nov 15 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7057 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other13th International Conference on Principles and Practice of Multi-Agent Systems, PRIMA 2010
CountryIndia
CityKolkata
Period11/12/1011/15/10

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Effect of DisCSP variable-ordering heuristics in scale-free networks'. Together they form a unique fingerprint.

  • Cite this

    Okimoto, T., Iwasaki, A., & Yokoo, M. (2012). Effect of DisCSP variable-ordering heuristics in scale-free networks. In Principles and Practice of Multi-Agent Systems - 13th International Conference, PRIMA 2010, Revised Selected Papers (pp. 166-180). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7057 LNAI). https://doi.org/10.1007/978-3-642-25920-3_12