메뉴 건너뛰기




Volumn , Issue , 1999, Pages 300-302

Fast online placement for reconfigurable computing systems

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER HARDWARE; FIELD PROGRAMMABLE GATE ARRAYS; LOGIC DESIGN; MICROPROCESSOR CHIPS;

EID: 0033488508     PISSN: 10823409     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (14)

References (11)
  • 3
    • 0020797485 scopus 로고
    • The bottom-left bin-packing heuristic: An efficient implementation
    • August
    • B. Chazelle. "The Bottom-Left Bin-Packing Heuristic: An Efficient Implementation". IEEE Transactions on Computers, C-32(8):697-707, August 1983.
    • (1983) IEEE Transactions on Computers , vol.C-32 , Issue.8 , pp. 697-707
    • Chazelle, B.1
  • 4
    • 0000950606 scopus 로고    scopus 로고
    • The roles of FPGAs in reprogrammable systems
    • April
    • S. Hauck. "The Roles of FPGAs in Reprogrammable Systems". Proceedings of the IEEE, 86(4):615-638, April 1998.
    • (1998) Proceedings of the IEEE , vol.86 , Issue.4 , pp. 615-638
    • Hauck, S.1
  • 5
    • 0012167822 scopus 로고    scopus 로고
    • An optimal algorithm for rectangle placement
    • In Technical Report UL-CSIS-97-1. Dept. of Computer Science and Information Systems, University of Limerick, Limerick, Ireland
    • P. Healy and M. Creavin. "An Optimal Algorithm for Rectangle Placement". In Technical Report UL-CSIS-97-1. Dept. of Computer Science and Information Systems, University of Limerick, Limerick, Ireland, 1997.
    • (1997)
    • Healy, P.1    Creavin, M.2
  • 6
    • 0003777592 scopus 로고    scopus 로고
    • PWS Publishing Company, 20 Park Plaza, Boston, MA 02116-4324; Approximation Algorithms for NP-Hard Problems, ed. D. S. Hochbaum
    • E. G. Coffman Jr, M. R. Garey, and D. S. Johnson. "Chapter 2: Approximation Algorithms for Bin Packing: A Survey", pages 46-93. PWS Publishing Company, 20 Park Plaza, Boston, MA 02116-4324, 1997. Approximation Algorithms for NP-Hard Problems, ed. D. S. Hochbaum.
    • (1997) Chapter 2: Approximation Algorithms for Bin Packing: A Survey , pp. 46-93
    • Coffman E.G., Jr.1    Garey, M.R.2    Johnson, D.S.3
  • 7
    • 0027558279 scopus 로고
    • Packings in two dimensions: Asymptotic average-case analysis of algorithms
    • March
    • E. G. Coffman Jr. and P. W. Shor. "Packings in Two Dimensions: Asymptotic Average-Case Analysis of Algorithms". Algorithmica, 9(3):253-277, March 1993.
    • (1993) Algorithmica , vol.9 , Issue.3 , pp. 253-277
    • Coffman E.G., Jr.1    Shor, P.W.2


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