메뉴 건너뛰기




Volumn 12, Issue 10, 2004, Pages 1118-1122

Ant colony system application to macrocell overlap removal

Author keywords

Ant colony optimization; Floorplanning; Macrocell placement; Overlap removal; Wirelength minimization

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; GRAPH THEORY; MATHEMATICAL MODELS; OPTIMIZATION; PARAMETER ESTIMATION; QUADRATIC PROGRAMMING;

EID: 6344278049     PISSN: 10638210     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVLSI.2004.832926     Document Type: Conference Paper
Times cited : (29)

References (13)
  • 4
    • 0026174925 scopus 로고
    • Analytical placement: A linear or a quadratic objective function?
    • G. Sigl, K. Doll, and F. M. Johannes, "Analytical placement: A linear or a quadratic objective function?," in Proc. Design Automation Conf., 1991, pp. 427-432.
    • (1991) Proc. Design Automation Conf. , pp. 427-432
    • Sigl, G.1    Doll, K.2    Johannes, F.M.3
  • 6
    • 0026399121 scopus 로고
    • A new method for floor planning using topological constraint reduction
    • Dec.
    • J. Vijayan and R.-S. Tsay, "A new method for floor planning using topological constraint reduction," IEEE Trans. Computer-Aided Design, vol. 10, pp. 1494-1501, Dec. 1991.
    • (1991) IEEE Trans. Computer-aided Design , vol.10 , pp. 1494-1501
    • Vijayan, J.1    Tsay, R.-S.2
  • 7
    • 0029452646 scopus 로고    scopus 로고
    • An improved floor planning algorithm using topological constraint reduction
    • B. Asato and H. H. Ali, "An improved floor planning algorithm using topological constraint reduction," in Proc. 38th Midwest Symp. Circuits Systems, 1996, pp. 310-313.
    • (1996) Proc. 38th Midwest Symp. Circuits Systems , pp. 310-313
    • Asato, B.1    Ali, H.H.2
  • 8
    • 2342423410 scopus 로고    scopus 로고
    • Constrained floorplanning using network flows
    • Apr.
    • Y. Feng, D. P. Mehta, and H. Yang, "Constrained floorplanning using network flows," IEEE Trans. Computer-Aided Design, vol. 23, pp. 572-580, Apr. 2004.
    • (2004) IEEE Trans. Computer-aided Design , vol.23 , pp. 572-580
    • Feng, Y.1    Mehta, D.P.2    Yang, H.3
  • 9
    • 0006685403 scopus 로고    scopus 로고
    • Post-placement residual-overlap removal with minimal movement
    • S. Nag and K. Chaudhary, "Post-placement residual-overlap removal with minimal movement," in Proc. DATE Conf., 1999, pp. 581-586.
    • (1999) Proc. DATE Conf. , pp. 581-586
    • Nag, S.1    Chaudhary, K.2
  • 10
    • 0031122887 scopus 로고    scopus 로고
    • Ant colony system: A cooperative learning approach to traveling salesman problem
    • Apr. Ant Colony Optimization: Publications. [Online]. Available
    • M. Dorigo and L. M. Gambardella, "Ant Colony System: A Cooperative Learning Approach to Traveling Salesman Problem," IEEE Trans. Evol. Comput., vol. 1, pp. 53-66, Apr. 1997. Ant Colony Optimization: Publications. [Online]. Available: iridia.ulb.ac.be/~mdorigo/ACO/publications.html.
    • (1997) IEEE Trans. Evol. Comput. , vol.1 , pp. 53-66
    • Dorigo, M.1    Gambardella, L.M.2
  • 11
    • 0030082551 scopus 로고    scopus 로고
    • The ant system: Optimization by a colony of cooperating agents
    • Jan.
    • M. Dorigo, V. Maniezzo, and A. Colorni, "The ant system: Optimization by a colony of cooperating agents," IEEE Trans. Syst., Man, Cybern. B, vol. 26, pp. 29-41, Jan. 1996.
    • (1996) IEEE Trans. Syst., Man, Cybern. B , vol.26 , pp. 29-41
    • Dorigo, M.1    Maniezzo, V.2    Colorni, A.3
  • 12
    • 85148633156 scopus 로고
    • Ant-Q: A reinforced learning approach to the traveling salesman problem
    • L. Gambardella and M. Dorigo, "Ant-Q: A reinforced learning approach to the traveling salesman problem," in Proc. 12th Int. Conf. Machine Learning, 1995, pp. 252-260.
    • (1995) Proc. 12th Int. Conf. Machine Learning , pp. 252-260
    • Gambardella, L.1    Dorigo, M.2
  • 13
    • 0038546313 scopus 로고    scopus 로고
    • An ant colony system hybridized with a new local search for the sequential ordering problem
    • L. M. Gambardella and M. Dorigo, "An ant colony system hybridized with a new local search for the sequential ordering problem," Inform. J. Computing, vol. 12, no. 3, pp. 237-255, 2000.
    • (2000) Inform. J. Computing , vol.12 , Issue.3 , pp. 237-255
    • Gambardella, L.M.1    Dorigo, M.2


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