An efficient cut-based algorithm on minimizing the number of L-shaped channels for safe routing ordering
| dc.citation.epage | 371 | en_US |
| dc.citation.spage | 366 | en_US |
| dc.contributor.author | Yan, JT | en_US |
| dc.contributor.department | 資訊工程學系 | zh_TW |
| dc.contributor.department | Department of Computer Science | en_US |
| dc.date.accessioned | 2014-12-08T15:27:42Z | |
| dc.date.available | 2014-12-08T15:27:42Z | |
| dc.date.issued | 1995 | en_US |
| dc.identifier.isbn | 0-8186-7165-3 | en_US |
| dc.identifier.journal | INTERNATIONAL CONFERENCE ON COMPUTER DESIGN: VLSI IN COMPUTERS & PROCESSORS, PROCEEDINGS | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/19955 | |
| dc.identifier.wosnumber | WOS:A1995BE54G00053 | |
| dc.language.iso | en_US | en_US |
| dc.title | An efficient cut-based algorithm on minimizing the number of L-shaped channels for safe routing ordering | en_US |
| dc.type | Proceedings Paper | en_US |
Files
License bundle
1 - 1 of 1
Loading...
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed to upon submission
- Description: