|
| Keyword : integer linear programming
|
Complexity and Exact Solution of Set-Pair Routing Problem
Yasuhiro TAKASHIMA | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2026/03/01
Vol. E109-A
No. 3 ;
pp. 590-595
Type of Manuscript:
Special Section PAPER (Special Section on VLSI Design and CAD Algorithms)
Category:
Keyword:
set-pair routing problem, NP-hard, integer linear programming, | | | Summary | Full Text:PDF | |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
|
A Scheduling Method Using Boolean Equations in High-Level Synthesis
Toshiaki MIYAZAKI | Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1992/12/25
Vol. E75-A
No. 12 ;
pp. 1728-1731
Type of Manuscript:
Special Section LETTER (Special Section on the 1992 IEICE Fall Conference)
Category:
Keyword:
integer linear programming, BDD, data path, | | | Summary | Full Text:PDF | |
|
|