A modified algorithm for the quadratic assignment problem using chaotic-neuro-dynamics for VLSI implementation

K. Tanaka, Y. Horio, K. Aihara

研究成果: Paper査読

6 被引用数 (Scopus)

抄録

The quadratic assignment problem (QAP) is one of the NP-hard combinatorial optimization problems, which is very difficult to solve [1]. The tabu search technique, one of the various heuristic methods for the QAP, has been implemented in a neural network form with chaotic dynamics [2]-[4]. In order to achieve a high-speed massively parallel solution of the QAP, a mixed analog/digital integrated circuit implementation of the system is mandatory. However, the algorithm in [4] cannot be implemented with IC technology as it is. Therefore, the algorithm in [4] is modified to be suitable for the analog IC implementation in this paper. The performance of the modified algorithm is investigated with numerical simulations. The circuit characteristics obtained from a prototype chip is extensively used in the simulations.

本文言語English
ページ240-245
ページ数6
出版ステータスPublished - 2001
外部発表はい
イベントInternational Joint Conference on Neural Networks (IJCNN'01) - Washington, DC, United States
継続期間: 2001 7月 152001 7月 19

Other

OtherInternational Joint Conference on Neural Networks (IJCNN'01)
国/地域United States
CityWashington, DC
Period01/7/1501/7/19

ASJC Scopus subject areas

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

フィンガープリント

「A modified algorithm for the quadratic assignment problem using chaotic-neuro-dynamics for VLSI implementation」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル