• DocumentCode
    1264313
  • Title

    A parallel algorithm for tiling problems

  • Author

    Takefuji, Yoshiyasu ; Lee, Kuo-Chun

  • Author_Institution
    Dept. of Electr. Eng. & Appl. Phys., Case Western Reserve Univ., Cleveland, OH, USA
  • Volume
    1
  • Issue
    1
  • fYear
    1990
  • fDate
    3/1/1990 12:00:00 AM
  • Firstpage
    143
  • Lastpage
    145
  • Abstract
    A parallel algorithm for tiling with polyominoes is presented. The tiling problem is to pack polyominoes in a finite checkerboard. The algorithm using l×m×n processing elements requires O(1) time, where l is the number of different kinds of polyominoes on an m×n checkerboard. The algorithm can be used for placement of components or cells in a very large-scale integrated circuit (VLSI) chip, designing and compacting printed circuit boards, and solving a variety of two- or three-dimensional packing problems
  • Keywords
    combinatorial mathematics; computational complexity; parallel algorithms; VLSI; packing problems; parallel algorithm; polyominoes; tiling problems; time complexity; Algorithm design and analysis; Degradation; Fires; Neural networks; Neurons; Parallel algorithms; Printed circuits; Printing; Stochastic resonance; Very large scale integration;
  • fLanguage
    English
  • Journal_Title
    Neural Networks, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1045-9227
  • Type

    jour

  • DOI
    10.1109/72.80215
  • Filename
    80215
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1264313