A repeated-update problem in the DeltaBlue algorithm

Tetsuya Suzuki, Takehiro Tokuda

Research output: Contribution to journalArticle

Abstract

We observe a repeated-update problem in the process of updating walkabout strengths of the DeltaBlue algorithm, which is known as a fast constraint solving method based on local propagation. According to the basic references on the DeltaBlue algorithm, the time complexity of the planning phase is described as O(MN) for a constraint problem such that the number of constraints is N and the maximum number of methods a constraint has is M. We, however, point out that the time complexity is not O(MN) using a very simple example. In this example, the time complexity is exponential order for N. Then we present a corrected DeltaBlue algorithm whose time complexity is O(EN2) for a constraint problem such that the number of constraints is N and the maximum number of variables a constraint has is E. Finally we measure the performance of the corrected DeltaBlue algorithm using two benchmarks.

Original languageEnglish
Pages (from-to)331-341
Number of pages11
JournalConstraints
Volume3
Issue number4
DOIs
Publication statusPublished - 1998 Oct
Externally publishedYes

Fingerprint

Planning

Keywords

  • Constraint solving algorithm
  • DeltaBlue algorithm
  • Local propagation

ASJC Scopus subject areas

  • Hardware and Architecture
  • Applied Mathematics

Cite this

A repeated-update problem in the DeltaBlue algorithm. / Suzuki, Tetsuya; Tokuda, Takehiro.

In: Constraints, Vol. 3, No. 4, 10.1998, p. 331-341.

Research output: Contribution to journalArticle

Suzuki, Tetsuya ; Tokuda, Takehiro. / A repeated-update problem in the DeltaBlue algorithm. In: Constraints. 1998 ; Vol. 3, No. 4. pp. 331-341.
@article{70f5b0f543944980a5ce9c103974bbbe,
title = "A repeated-update problem in the DeltaBlue algorithm",
abstract = "We observe a repeated-update problem in the process of updating walkabout strengths of the DeltaBlue algorithm, which is known as a fast constraint solving method based on local propagation. According to the basic references on the DeltaBlue algorithm, the time complexity of the planning phase is described as O(MN) for a constraint problem such that the number of constraints is N and the maximum number of methods a constraint has is M. We, however, point out that the time complexity is not O(MN) using a very simple example. In this example, the time complexity is exponential order for N. Then we present a corrected DeltaBlue algorithm whose time complexity is O(EN2) for a constraint problem such that the number of constraints is N and the maximum number of variables a constraint has is E. Finally we measure the performance of the corrected DeltaBlue algorithm using two benchmarks.",
keywords = "Constraint solving algorithm, DeltaBlue algorithm, Local propagation",
author = "Tetsuya Suzuki and Takehiro Tokuda",
year = "1998",
month = "10",
doi = "10.1023/A:1009776022504",
language = "English",
volume = "3",
pages = "331--341",
journal = "Constraints",
issn = "1383-7133",
publisher = "Springer Netherlands",
number = "4",

}

TY - JOUR

T1 - A repeated-update problem in the DeltaBlue algorithm

AU - Suzuki, Tetsuya

AU - Tokuda, Takehiro

PY - 1998/10

Y1 - 1998/10

N2 - We observe a repeated-update problem in the process of updating walkabout strengths of the DeltaBlue algorithm, which is known as a fast constraint solving method based on local propagation. According to the basic references on the DeltaBlue algorithm, the time complexity of the planning phase is described as O(MN) for a constraint problem such that the number of constraints is N and the maximum number of methods a constraint has is M. We, however, point out that the time complexity is not O(MN) using a very simple example. In this example, the time complexity is exponential order for N. Then we present a corrected DeltaBlue algorithm whose time complexity is O(EN2) for a constraint problem such that the number of constraints is N and the maximum number of variables a constraint has is E. Finally we measure the performance of the corrected DeltaBlue algorithm using two benchmarks.

AB - We observe a repeated-update problem in the process of updating walkabout strengths of the DeltaBlue algorithm, which is known as a fast constraint solving method based on local propagation. According to the basic references on the DeltaBlue algorithm, the time complexity of the planning phase is described as O(MN) for a constraint problem such that the number of constraints is N and the maximum number of methods a constraint has is M. We, however, point out that the time complexity is not O(MN) using a very simple example. In this example, the time complexity is exponential order for N. Then we present a corrected DeltaBlue algorithm whose time complexity is O(EN2) for a constraint problem such that the number of constraints is N and the maximum number of variables a constraint has is E. Finally we measure the performance of the corrected DeltaBlue algorithm using two benchmarks.

KW - Constraint solving algorithm

KW - DeltaBlue algorithm

KW - Local propagation

UR - http://www.scopus.com/inward/record.url?scp=10044269965&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=10044269965&partnerID=8YFLogxK

U2 - 10.1023/A:1009776022504

DO - 10.1023/A:1009776022504

M3 - Article

AN - SCOPUS:10044269965

VL - 3

SP - 331

EP - 341

JO - Constraints

JF - Constraints

SN - 1383-7133

IS - 4

ER -