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 language | English |
|---|---|
| Title of host publication | Proceedings of the International Joint Conference on Neural Networks |
| Editors | Anon |
| Publisher | Publ by IEEE |
| Pages | 1499-1502 |
| Number of pages | 4 |
| Volume | 2 |
| ISBN (Print) | 0780314212 |
| Publication status | Published - 1993 |
| Externally published | Yes |
| Event | Proceedings of 1993 International Joint Conference on Neural Networks. Part 2 (of 3) - Nagoya, Jpn Duration: 1993 Oct 25 → 1993 Oct 29 |
Other
| Other | Proceedings of 1993 International Joint Conference on Neural Networks. Part 2 (of 3) |
|---|---|
| City | Nagoya, Jpn |
| Period | 93/10/25 → 93/10/29 |
Fingerprint
ASJC Scopus subject areas
- Software
Cite this
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 proceeding › Conference contribution
}
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
AN - SCOPUS:0027889274
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 -