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
Volume2
ISBN (Print)0780314212
Publication statusPublished - 1993
Externally publishedYes
EventProceedings of 1993 International Joint Conference on Neural Networks. Part 2 (of 3) - Nagoya, Jpn
Duration: 1993 Oct 251993 Oct 29

Other

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

Fingerprint

Parallel algorithms
Computational complexity
Neural networks

ASJC Scopus subject areas

  • Software

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 (Vol. 2, pp. 1499-1502). Publ by IEEE.

Near-optimum parallel algorithm for one-dimensional gate assignment problems. / Tsuchiya, Kazuhiro; Takefuji, Yoshiyasu.

Proceedings of the International Joint Conference on Neural Networks. ed. / Anon. Vol. 2 Publ by IEEE, 1993. p. 1499-1502.

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

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. vol. 2, Publ by IEEE, pp. 1499-1502, Proceedings of 1993 International Joint Conference on Neural Networks. Part 2 (of 3), Nagoya, Jpn, 93/10/25.
Tsuchiya K, Takefuji Y. Near-optimum parallel algorithm for one-dimensional gate assignment problems. In Anon, editor, Proceedings of the International Joint Conference on Neural Networks. Vol. 2. Publ by IEEE. 1993. p. 1499-1502
Tsuchiya, Kazuhiro ; Takefuji, Yoshiyasu. / Near-optimum parallel algorithm for one-dimensional gate assignment problems. Proceedings of the International Joint Conference on Neural Networks. editor / Anon. Vol. 2 Publ by IEEE, 1993. pp. 1499-1502
@inproceedings{4df0a20ff92140efbc9a1232ec6453ff,
title = "Near-optimum parallel algorithm for one-dimensional gate assignment problems",
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.",
author = "Kazuhiro Tsuchiya and Yoshiyasu Takefuji",
year = "1993",
language = "English",
isbn = "0780314212",
volume = "2",
pages = "1499--1502",
editor = "Anon",
booktitle = "Proceedings of the International Joint Conference on Neural Networks",
publisher = "Publ by IEEE",

}

TY - GEN

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

AU - Tsuchiya, Kazuhiro

AU - Takefuji, Yoshiyasu

PY - 1993

Y1 - 1993

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0027889274&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0027889274&partnerID=8YFLogxK

M3 - Conference contribution

SN - 0780314212

VL - 2

SP - 1499

EP - 1502

BT - Proceedings of the International Joint Conference on Neural Networks

A2 - Anon, null

PB - Publ by IEEE

ER -