Near-optimum parallel algorithm for one-dimensional gate assignment problems

Kazuhiro Tsuchiya, Yoshiyasu Takefuji

研究成果: Conference contribution

抄録

A near-optimum parallel algorithm for one-dimensional gate assignment problems is presented in this paper where the problem is NP-hard. The proposed system is composed of an n×n two-dimensional maximum neural network for (n+2)-gate assignment problems. Our algorithm has discovered the improved solution in the benchmark problem over the existing algorithms.

本文言語English
ホスト出版物のタイトルProceedings of the International Joint Conference on Neural Networks
編集者 Anon
出版社Publ by IEEE
ページ1499-1502
ページ数4
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

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

フィンガープリント

「Near-optimum parallel algorithm for one-dimensional gate assignment problems」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル