메뉴 건너뛰기




Volumn 1117, Issue , 2009, Pages 145-156

Using ant colony optimization for routing in VLSI chips

Author keywords

Ant Golony Optimization; Routing; VLSI Design

Indexed keywords


EID: 70450263706     PISSN: 0094243X     EISSN: 15517616     Source Type: Conference Proceeding    
DOI: 10.1063/1.3130616     Document Type: Conference Paper
Times cited : (6)

References (30)
  • 1
    • 57849139558 scopus 로고    scopus 로고
    • 45nm Design for Manufacturing
    • C. Webb, 45nm Design for Manufacturing. Intel Technology e-Joumal 12, 121-130 (2008).
    • (2008) Intel Technology e-Joumal , vol.12 , pp. 121-130
    • Webb, C.1
  • 5
    • 28344452134 scopus 로고    scopus 로고
    • W.R. Davis, J. Wilson, S. Mick, J. Xu, H. Hua, C. Mineo, A.M. Sule, M. Steer and P.D. Franzon, Design and Test of Computers, 2005, pp.498-510. 155
    • W.R. Davis, J. Wilson, S. Mick, J. Xu, H. Hua, C. Mineo, A.M. Sule, M. Steer and P.D. Franzon, Design and Test of Computers, 2005, pp.498-510. 155
  • 9
    • 0031125464 scopus 로고    scopus 로고
    • A parallel genetic algorithm for performance-driven VLSI routing
    • J. Lienig, A parallel genetic algorithm for performance-driven VLSI routing. IEEE Transactions on Evolutionary Computation 1, 29-39 (1997).
    • (1997) IEEE Transactions on Evolutionary Computation , vol.1 , pp. 29-39
    • Lienig, J.1
  • 11
    • 11244299747 scopus 로고    scopus 로고
    • Y. Hu, T. Jing, X. Hong, Z. Feng, X. Hu and G. Yan, An Efficient Rectilinear Steiner Minimum Tree Algorithm Based on Ant Colony Optimization. Proceedings of IEEE International Conference on Communications, Circuits and Systems 2, 1276-1280 (2004).
    • Y. Hu, T. Jing, X. Hong, Z. Feng, X. Hu and G. Yan, An Efficient Rectilinear Steiner Minimum Tree Algorithm Based on Ant Colony Optimization. Proceedings of IEEE International Conference on Communications, Circuits and Systems 2, 1276-1280 (2004).
  • 12
    • 34548105491 scopus 로고    scopus 로고
    • An Ant Algorithm for the Steiner Tree Problem in graphs. Applications of Evolutionary Computing
    • Valencia, Spain
    • L. Luyet, S. Varone and N. Zufferey, An Ant Algorithm for the Steiner Tree Problem in graphs. Applications of Evolutionary Computing. Evo Workshops, Valencia, Spain, 2007, pp.42-51.
    • (2007) Evo Workshops , pp. 42-51
    • Luyet, L.1    Varone, S.2    Zufferey, N.3
  • 17
  • 18
    • 0002012598 scopus 로고    scopus 로고
    • The ant colony optimization metaheuristic
    • M. Dorigo and D.G. Caro, "The ant colony optimization metaheuristic". New ideas in optimization, 1999, pp. 11-30.
    • (1999) New ideas in optimization , pp. 11-30
    • Dorigo, M.1    Caro, D.G.2
  • 19
    • 70450266575 scopus 로고    scopus 로고
    • T. Stutzle and M. Dorigo, ACO Algorithms for the traveling salesman Problem. K. Miettinen, P. Neittaanmaki, Evolutionary Algorithms in Engineering and Computer Science, 1999, pp.160-184.
    • T. Stutzle and M. Dorigo, ACO Algorithms for the traveling salesman Problem. K. Miettinen, P. Neittaanmaki, Evolutionary Algorithms in Engineering and Computer Science, 1999, pp.160-184.
  • 24
    • 70450254276 scopus 로고    scopus 로고
    • Characterization of a Printed Circuit Board Via. B.S.E.E
    • EAS-ECE-2000-09, 1998
    • B.J. LaMeres, Characterization of a Printed Circuit Board Via. B.S.E.E., Montana State University Technical Report EAS-ECE-2000-09, 1998.
    • Montana State University Technical Report
    • LaMeres, B.J.1
  • 26
    • 0033703013 scopus 로고    scopus 로고
    • Manhattan or NonManhattan- A Study of Alternative VLSI Routing Architectures
    • Chicago, Illinois
    • C. Koh, P.H. Madden, Manhattan or NonManhattan- A Study of Alternative VLSI Routing Architectures. Proceedings of the 10th Great Lakes symposium on VLSI, Chicago, Illinois, 2000, pp.47-52.
    • (2000) Proceedings of the 10th Great Lakes symposium on VLSI , pp. 47-52
    • Koh, C.1    Madden, P.H.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.