By Topic

Note on optimal tile partition for space region of integrated-circuit geometry

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ku, L.-P. ; Dept. of Inf. Syst. & Comput. Sci., Nat. Univ. of Singapore, Singapore ; Leong, H.W.

An OTP algorithm for solving the optimal tile-partitioning problem has recently been published by P.Y. Hsiao et al. (1993). The OTP algorithm makes use of an elimination algorithm to find a maximum set of nonintersecting critical partition edges. It is shown that this elimination algorithm is flawed

Published in:

Computers and Digital Techniques, IEE Proceedings -  (Volume:143 ,  Issue: 4 )