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 |
| ISBN (Print) | 0780314212 |
| Publication status | Published - 1993 Dec 1 |
| 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 |
Publication series
| Name | Proceedings of the International Joint Conference on Neural Networks |
|---|---|
| Volume | 2 |
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
- 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.