O(1) approximate parallel algorithm for the n-task-n-person assignment problem

Yong Beom Cho, Takakazu Kurokawa, Yoshiyasu Takefuji, Hwa Kim

研究成果: Conference contribution

2 被引用数 (Scopus)

抄録

A parallel algorithm for the n-task-n-person assignment problem is presented in this paper. The proposed algorithm is based on the artificial neural network model where a large number of simple processing elements are used. Through a large number of simulation runs, it was empirically shown that the state of the system can converge to the solution within a hundred iteration steps regardless of the problem size n. The proposed algorithm using n2 processing elements requires computational bounds of a nearly O(1) time.

本文言語English
ホスト出版物のタイトルProceedings of the International Joint Conference on Neural Networks
編集者 Anon
出版社Publ by IEEE
ページ1503-1505
ページ数3
ISBN(印刷版)0780314212
出版ステータスPublished - 1993 12月 1
外部発表はい
イベントProceedings of 1993 International Joint Conference on Neural Networks. Part 2 (of 3) - Nagoya, Jpn
継続期間: 1993 10月 251993 10月 29

出版物シリーズ

名前Proceedings of the International Joint Conference on Neural Networks
2

Other

OtherProceedings of 1993 International Joint Conference on Neural Networks. Part 2 (of 3)
CityNagoya, Jpn
Period93/10/2593/10/29

ASJC Scopus subject areas

  • ソフトウェア
  • 人工知能

フィンガープリント

「O(1) approximate parallel algorithm for the n-task-n-person assignment problem」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル