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

Kazuhiro Tsuchiya, Yoshiyasu Takefuji

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish
Title of host publicationProceedings of the International Joint Conference on Neural Networks
Editors Anon
PublisherPubl by IEEE
Pages1499-1502
Number of pages4
ISBN (Print)0780314212
Publication statusPublished - 1993 Dec 1
Externally publishedYes
EventProceedings of 1993 International Joint Conference on Neural Networks. Part 2 (of 3) - Nagoya, Jpn
Duration: 1993 Oct 251993 Oct 29

Publication series

NameProceedings of the International Joint Conference on Neural Networks
Volume2

Other

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

    Fingerprint

ASJC Scopus subject areas

  • Software
  • Artificial Intelligence

Cite this

Tsuchiya, K., & Takefuji, Y. (1993). Near-optimum parallel algorithm for one-dimensional gate assignment problems. In Anon (Ed.), Proceedings of the International Joint Conference on Neural Networks (pp. 1499-1502). (Proceedings of the International Joint Conference on Neural Networks; Vol. 2). Publ by IEEE.