Matches in SemOpenAlex for { <https://semopenalex.org/work/W2079502002> ?p ?o ?g. }
Showing items 1 to 59 of
59
with 100 items per page.
- W2079502002 endingPage "1212" @default.
- W2079502002 startingPage "1191" @default.
- W2079502002 abstract "We consider the following algorithmic problem, which arises in connection with optimally choosing beam widths and positions for electron exposure of integrated circuit wafers. Let H > 0 be a fixed real number, and let c be a fixed, positive-valued, nondecreasing cost function defined on (0, H]. An instance of the problem consists of a given range R = [a, b] and n given intervals I <inf xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>i</inf> = [a <inf xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>i</inf> , b <inf xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>i</inf> ], 1 ≤ i ≤ n, each contained in R and of length not exceeding H. A solution (or feasible solution) for such an instance is a collection of segments, Si, S <inf xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>2</inf> , …, S <inf xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>k</inf> , each of length at most H and contained in R, such that each given interval is contained in at least one segment and the union of all the segments is R. The goal is to find an optimal solution with respect to c, i.e., a solution for which the sum of the costs of the individual segment lengths is as small as possible. The segments in a solution describe the beam positions and widths, projected on one side of the wafer, and the given intervals correspond to particularly sensitive regions on the layout mask, each of which must be entirely exposed by a single scan. The cost function gives the time required for a single scan of given width, including alignment overhead. Using dynamic programming techniques, we give efficient algorithms and data structures for solving this problem for several natural classes of cost functions, the most general of which is the class of all concave increasing functions, solved by an algorithm that runs in time O(n <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>2</sup> )." @default.
- W2079502002 created "2016-06-24" @default.
- W2079502002 creator A5047995033 @default.
- W2079502002 creator A5062730683 @default.
- W2079502002 date "1984-07-08" @default.
- W2079502002 modified "2023-09-25" @default.
- W2079502002 title "Optimum Scan-Width Selection Under Containment Constraints" @default.
- W2079502002 cites W2139623334 @default.
- W2079502002 doi "https://doi.org/10.1002/j.1538-7305.1984.tb00118.x" @default.
- W2079502002 hasPublicationYear "1984" @default.
- W2079502002 type Work @default.
- W2079502002 sameAs 2079502002 @default.
- W2079502002 citedByCount "0" @default.
- W2079502002 crossrefType "journal-article" @default.
- W2079502002 hasAuthorship W2079502002A5047995033 @default.
- W2079502002 hasAuthorship W2079502002A5062730683 @default.
- W2079502002 hasConcept C11413529 @default.
- W2079502002 hasConcept C114614502 @default.
- W2079502002 hasConcept C118615104 @default.
- W2079502002 hasConcept C14036430 @default.
- W2079502002 hasConcept C154945302 @default.
- W2079502002 hasConcept C2778067643 @default.
- W2079502002 hasConcept C33923547 @default.
- W2079502002 hasConcept C41008148 @default.
- W2079502002 hasConcept C78458016 @default.
- W2079502002 hasConcept C81917197 @default.
- W2079502002 hasConcept C86803240 @default.
- W2079502002 hasConceptScore W2079502002C11413529 @default.
- W2079502002 hasConceptScore W2079502002C114614502 @default.
- W2079502002 hasConceptScore W2079502002C118615104 @default.
- W2079502002 hasConceptScore W2079502002C14036430 @default.
- W2079502002 hasConceptScore W2079502002C154945302 @default.
- W2079502002 hasConceptScore W2079502002C2778067643 @default.
- W2079502002 hasConceptScore W2079502002C33923547 @default.
- W2079502002 hasConceptScore W2079502002C41008148 @default.
- W2079502002 hasConceptScore W2079502002C78458016 @default.
- W2079502002 hasConceptScore W2079502002C81917197 @default.
- W2079502002 hasConceptScore W2079502002C86803240 @default.
- W2079502002 hasIssue "6" @default.
- W2079502002 hasLocation W20795020021 @default.
- W2079502002 hasOpenAccess W2079502002 @default.
- W2079502002 hasPrimaryLocation W20795020021 @default.
- W2079502002 hasRelatedWork W1978042415 @default.
- W2079502002 hasRelatedWork W1984138193 @default.
- W2079502002 hasRelatedWork W2015274193 @default.
- W2079502002 hasRelatedWork W2045297403 @default.
- W2079502002 hasRelatedWork W2125356288 @default.
- W2079502002 hasRelatedWork W2128302072 @default.
- W2079502002 hasRelatedWork W2159964792 @default.
- W2079502002 hasRelatedWork W2606073172 @default.
- W2079502002 hasRelatedWork W2970622411 @default.
- W2079502002 hasRelatedWork W861025093 @default.
- W2079502002 hasVolume "63" @default.
- W2079502002 isParatext "false" @default.
- W2079502002 isRetracted "false" @default.
- W2079502002 magId "2079502002" @default.
- W2079502002 workType "article" @default.