Open Access
MATEC Web of Conf.
Volume 399, 2024
2024 3rd International Conference on Advanced Electronics, Electrical and Green Energy (AEEGE 2024)
Article Number 00015
Number of page(s) 9
Published online 24 June 2024
  1. Xu Ning, Hong Xianlong. Physical Design Theory and Algorithm of VLSI [M]. Beijing: Tsinghua University Press,2009. [Google Scholar]
  2. Viswanathan N, Alpert C, Sze C, et al. The DAC 2012 routability-driven placement contest and benchmark suite[C].DAC Design Automation Conference 2012,2012: 774–782. [Google Scholar]
  3. Batterywala S, Shenoy N, Nicholls W, et al. Track assignment: A desirable intermediate step between global routing and detailed routing[C].Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design,2002: 59–66. [Google Scholar]
  4. Wong M-P, Liu W-H, Wang T-C. Negotiation-based track assignment considering local nets[C].2016 21st Asia and South Pacific Design Automation Conference (ASP-DAC),2016: 378–383. [Google Scholar]
  5. Guo Wenzhong, Chen Xiaohua, Liu Genggeng, et al. Trajectory allocation algorithm based on hybrid discrete particle swarm optimization [J]. Pattern Recognition and Artificial Intelligence,2019, 32 (08): 758–770. [Google Scholar]
  6. Lee C-K. Deep Learning Creativity in EDA[C].2020 International Symposium on VLSI Design, Automation and Test (VLSI-DAT),2020: 1–1. [Google Scholar]
  7. Kingma D P, Mohamed S, Jimenez Rezende D, et al.Semi-supervised learning with deep generative models[J].Advances in neural information processing systems,2014, 27. [Google Scholar]
  8. Lee M, Xiong Y, Yu G, et al. Deep neural networks for linear sum assignment problems[J].IEEE Wireless Communications Letters, 2018, 7(6): 962–965. [CrossRef] [Google Scholar]
  9. Hsu M-K, Chen Y-F, Huang C-C, et al. Routability-driven placement for hierarchical mixed-size circuit designs[C].Proceedings of the 50th Annual Design Automation Conference,2013: 1–6. [Google Scholar]
  10. Liu W H, Kao W C, Li Y L, et al. NCTU-GR 2.0: Multithreaded Collision-Aware Global Routing with Bounded-Length Maze Routing[J].IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2013, 32(5): 709–722. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.