- About
-
The Global ETD Search service is a free service for researchers
to find electronic theses and dissertations. This service is
provided by the
Networked Digital Library of Theses and Dissertations.
Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
Search results
Showing 61 to 70 of 608 (0.059 seconds)Spelling suggestions: "subject:"computer programming"" "subject:"computer erogramming""
| 61 |
Towards an object-oriented refinement calculus /Shield, Jamie Barry Nathan. January 2004 (has links) (PDF)
Thesis (Ph.D.) - University of Queensland, 2004. / Includes bibliography.
|
| 62 |
DYMOS a dynamic modification system /Lee, Insup. January 1900 (has links)
Thesis (Ph. D.)--University of Wisconsin--Madison, 1983. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 152-155).
|
| 63 |
An experiment in computer design the application of elementary control in optimizing the balance between functional capability and hardware complexity.Rusterholz, John Theophil, January 1969 (has links)
Thesis (M.S.)--University of Wisconsin--Madison, 1969. / eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references.
|
| 64 |
Optimal design of automatic control systems by use of dynamic programming techniquesFang, Yang, January 1959 (has links)
Thesis (Ph. D.)--University of Wisconsin--Madison, 1959. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 108-113).
|
| 65 |
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.
|
| 66 |
PAT a pseudo-assembler-translator for the WISC /McClure, Charles William. January 1961 (has links)
Thesis (M.S.)--University of Wisconsin--Madison, 1961. / Typescript. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references.
|
| 67 |
Decidability and expressiveness of logics of processes /Abrahamson, Karl Raymond. January 1980 (has links)
Thesis--University of Washington. / Vita. Bibliography: leaves [164]-167.
|
| 68 |
Cooperative bug isolation winning thesis of the 2005 ACM Doctoral Dissertation Competition /Liblit, Ben. January 1900 (has links)
Revised thesis (Ph.D.) - University of California, Berkeley, 2004. / Includes bibliographical references (p. 97-101) and index.
|
| 69 |
Dynamically discovering likely program invariants /Ernst, Michael D. January 2000 (has links)
Thesis (Ph. D.)--University of Washington, 2000. / Vita. Includes bibliographical references (p. 125-141).
|
| 70 |
Parallel functional programming for message-passing multiprocessorsOstheimer, Gerald January 1993 (has links)
We propose a framework for the evaluation of implicitly parallel functional programs on message passing multiprocessors with special emphasis on the issue of load bounding. The model is based on a new encoding of the lambda-calculus in Milner's pi-calculus and combines lazy evaluation and eager (parallel) evaluation in the same framework. The pi-calculus encoding serves as the specification of a more concrete compilation scheme mapping a simple functional language into a message passing, parallel program. We show how and under which conditions we can guarantee successful load bounding based on this compilation scheme. Finally we discuss the architectural requirements for a machine to support our model efficiently and we present a simple RISC-style processor architecture which meets those criteria.
|
Page generated in 0.0643 seconds