Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 2 of 2 for “"Stencil Planning"”.
-
Polynomial time optimal algorithm for stencil row planning in e-beam lithography
… (CP) technique has been proposed, and its stencil planning can be optimized with awareness of overlapping characters. However, the top-level 2D stencil planning problem has been proven to be an NP-hard problem. As its most essential step, the 1D row ordering is believed hard as well, and no …
-
Algorithms for DFM in electronic design automation
… projection technique has been proposed, and its stencil planning can be optimized with an awareness of overlapping characters. 2D stencil planning is proved NP-Hard. With the assumption of standard cells, the 2D problem can be partitioned into 1D row ordering subproblems; however, it is also …