메뉴 건너뛰기




Volumn 2000-January, Issue , 2000, Pages 8-12

Corner block list: An effective and efficient topological representation of non-slicing floorplan

Author keywords

[No Author keywords available]

Indexed keywords

ASPECT RATIO; OPTIMIZATION; SIMULATED ANNEALING; TOPOLOGY; ALGORITHMS; BENCHMARKING; C (PROGRAMMING LANGUAGE); COMPUTER WORKSTATIONS; INTEGRATED CIRCUIT LAYOUT; THEOREM PROVING; VLSI CIRCUITS;

EID: 0034481271     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCAD.2000.896442     Document Type: Conference Paper
Times cited : (309)

References (7)
  • 4
    • 0003962144 scopus 로고    scopus 로고
    • An algorithm for finding a maximum-weight decreasing sequence in a permutation, motivated by rectangle packing problem
    • T.Tahahashi, " An algorithm for finding a maximum-weight decreasing sequence in a permutation, motivated by rectangle packing problem", Technical report of IEICE, vol. VLD 96, no.201, 31-35, 1996.
    • (1996) Technical Report of IEICE , vol.VLD 96 , Issue.201 , pp. 31-35
    • Tahahashi, T.1
  • 6
    • 0032690067 scopus 로고    scopus 로고
    • An O-tree representation of non-slicing floorplan and its applications
    • P.N.Guo, C.K.Cheng, " An O-tree representation of non-slicing floorplan and its applications", in: ACM/IEEE Design Automation Conference, 1999.
    • (1999) ACM/IEEE Design Automation Conference
    • Guo, P.N.1    Cheng, C.K.2
  • 7
    • 26444479778 scopus 로고
    • Optimization by simulated annealing
    • S.Kirkpatrick et al. "Optimization by simulated annealing, " Science, vol. 220, 671-680, 1983.
    • (1983) Science , vol.220 , pp. 671-680
    • Kirkpatrick, S.1


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