A repeated-update problem in the DeltaBlue algorithm

Tetsuya Suzuki, Takehiro Tokuda

研究成果: Article査読

抄録

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.

本文言語English
ページ(範囲)331-341
ページ数11
ジャーナルConstraints
3
4
DOI
出版ステータスPublished - 1998 10
外部発表はい

ASJC Scopus subject areas

  • ソフトウェア
  • 離散数学と組合せ数学
  • 計算理論と計算数学
  • 人工知能

フィンガープリント

「A repeated-update problem in the DeltaBlue algorithm」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル