Speed-up and application distributed constraint satisfaction to communication network path assignments

Yoshiyasu Nishibe, Kazuhiro Kuwabara, Makoto Yokoo, Toru Ishida

研究成果: Article査読

2 被引用数 (Scopus)

抄録

The distributed constraint satisfaction algorithm is considered. It attempts to improve the processing speed by introducing the ordering based on heuristics. The ordering is a technique which suppresses the expansion of search space by ordering the variables and the value assignments. The communication path allocation problem is considered as an application of the distributed constraint satisfaction. The presented method is evaluated through the problems derived from the actual data of the communication network, and the effectiveness of the ordering is demonstrated.

本文言語English
ページ(範囲)54-67
ページ数14
ジャーナルSystems and Computers in Japan
25
12
出版ステータスPublished - 1994 11 1
外部発表はい

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Hardware and Architecture
  • Computational Theory and Mathematics

フィンガープリント 「Speed-up and application distributed constraint satisfaction to communication network path assignments」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル