메뉴 건너뛰기




Volumn 17, Issue 1, 1998, Pages 60-68

VLSI/PCB placement with obstacles based on sequence pair

Author keywords

Obstacle, placement problem, preplaced module, sequence pair

Indexed keywords

COMPUTATIONAL COMPLEXITY; PRINTED CIRCUIT BOARDS; SIMULATED ANNEALING; VLSI CIRCUITS;

EID: 0031648233     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/43.673633     Document Type: Article
Times cited : (48)

References (9)
  • 1
    • 0023210872 scopus 로고
    • An automatic rectilinear partitioning procedure for standard cells
    • M. C. Chi, "An automatic rectilinear partitioning procedure for standard cells," in Proc. 24th ACM/IEEE Design Autom. Conf., pp. 50-55, 1987.
    • (1987) Proc. 24th ACM/IEEE Design Autom. Conf. , pp. 50-55
    • Chi, M.C.1
  • 2
    • 0022199376 scopus 로고
    • An analytical algorithm for placement of arbitrarily sized rectangular blocks, in
    • L. Sha and R. W. Dutton, "An analytical algorithm for placement of arbitrarily sized rectangular blocks," in Proc. 22th ACM/IEEE Design Autom. Conf., 1985, pp. 602-608.
    • (1985) Proc. 22th ACM/IEEE Design Autom. Conf. , pp. 602-608
    • Sha, L.1    Dutton, R.W.2
  • 3
    • 0023978676 scopus 로고
    • Model and solution strategy for placement of rectangular blocks in the Euclidean plane
    • Mar.
    • A. Alon and U. Ascher, "Model and solution strategy for placement of rectangular blocks in the Euclidean plane," IEEE Trans. Computer-Aided Design, vol. 7, no. 3, pp. 378-386, Mar. 1988.
    • (1988) IEEE Trans. Computer-Aided Design , vol.7 , Issue.3 , pp. 378-386
    • Alon, A.1    Ascher, U.2


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