|
|
All Technical Committee Conferences (Searched in: All Years)
|
|
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Descending) |
|
Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
VLD, DC, RECONF, ICD, IPSJ-SLDM [detail] |
2023-11-17 14:50 |
Kumamoto |
Civic Auditorium Sears Home Yume Hall (Primary: On-site, Secondary: Online) |
An Improved Routing Method by SAT for Set-Pair Routing Problem Koki Nagakura, Kunihiro Fujiyoshi (TUAT) VLD2023-77 ICD2023-85 DC2023-84 RECONF2023-80 |
A set-pair routing problem is a single-layer routing problem in which combinations of these pins to be connected by rout... [more] |
VLD2023-77 ICD2023-85 DC2023-84 RECONF2023-80 pp.243-248 |
MSS, CAS, SIP, VLD |
2023-07-06 11:20 |
Hokkaido |
(Primary: On-site, Secondary: Online) |
Fast Method of Integer Linear Programming for Set-Pair Routing Problem Yasuhiro Takashima (Univ. of Kitakyushu) CAS2023-6 VLD2023-6 SIP2023-22 MSS2023-6 |
This paper proposes a fast method of integer linear programming for Set-pair routing problem. The previous works are fas... [more] |
CAS2023-6 VLD2023-6 SIP2023-22 MSS2023-6 pp.28-33 |
VLD, DC, RECONF, ICD, IPSJ-SLDM [detail] |
2022-11-28 13:55 |
Kumamoto |
(Primary: On-site, Secondary: Online) |
A Routing Method by SAT for Set-Pair Routing Problem Koki Nagakura, Rintaro Yokoya, Kunihiro Fujiyoshi (Tokyo Univ of A and T) VLD2022-21 ICD2022-38 DC2022-37 RECONF2022-44 |
Set-pair routing problem is a single-layer routing problem in which a one-to-one connection is made between equal number... [more] |
VLD2022-21 ICD2022-38 DC2022-37 RECONF2022-44 pp.13-18 |
HWS, VLD [detail] |
2020-03-04 09:55 |
Okinawa |
Okinawa Ken Seinen Kaikan (Cancelled but technical report was issued) |
A Pin-Pair Routing Method for Length Difference Reduction in Set-Pair Routing Kunihiko Wada, Shimpei Sato, Atsushi Takahashi (TokyoTech) VLD2019-95 HWS2019-68 |
In this paper, we propose a Routing method that aims to reduce total wire length and wire length difference for Set-Pair... [more] |
VLD2019-95 HWS2019-68 pp.7-12 |
HWS, VLD |
2019-02-27 13:55 |
Okinawa |
Okinawa Ken Seinen Kaikan |
Set-Pair Routing Algorithm with Selective Pin-Pair Connections Kano Akagi, Shimpei Sato, Atsushi Takahashi (Tokyo Tech) VLD2018-99 HWS2018-62 |
We propose a set-pair routing algorithm which efficiently generates a length matched routing pattern. In our algorithm, ... [more] |
VLD2018-99 HWS2018-62 pp.37-42 |
|
|
|
Copyright and reproduction :
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
|
[Return to Top Page]
[Return to IEICE Web Page]
|