Spelling suggestions: "subject:"algorithms. computer programming."" "subject:"algorithms. coomputer programming.""
1 |
Fast multiplication of multiple-precision integers /Benz, Sonja. January 1991 (has links)
Thesis (M.S.)--Rochester Institute of Technology, 1991. / Typescript. Includes bibliographical references (leaves 86-88).
|
2 |
Two results in algorithm design : finding least-weight subsequences with fewer processors and traversing an obstacle-spread terrain without a map /Chan, Kwong-fai. January 1991 (has links)
Thesis (M. Phil.)--University of Hong Kong, 1991.
|
3 |
Algebraic algorithms for computing the complex zeros of Gaussian polynomialsPinkert, James R. January 1973 (has links)
Thesis (Ph. D.)--University of Wisconsin--Madison, 1973. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliography.
|
4 |
Software templates /Volpano, Dennis M., January 1986 (has links)
Thesis (Ph. D.)--Oregon Graduate Center, 1986.
|
5 |
River router for the graphics editor CaesarHolla, Jaya 11 1900 (has links) (PDF)
M.S. / Computer Science / A general river routing algorithm is described. It is assumed that there is one layer available for routing and the terminals are on the boundaries of an arbitrarily shaped rectilinear routing region. All nets are two terminal nets. No crossover is permitted between nets. A minimum separation must be maintained between wires to prevent design rule violations. The separation and default width for all nets are obtained from a parameter file. A command line option permits the user to change the width. The algorithm assumes no grid on the routing plane. The number of corners in a given route is reduced by flipping corners.
|
Page generated in 0.1169 seconds