- 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 131 to 140 of 715 (0.026 seconds)| 131 |
Machine translation of a digital design languageRyniker, Richard William, January 1967 (has links)
Thesis (M.S.)--University of Wisconsin--Madison, 1967. / eContent provider-neutral record in process. Description based on print version record.
|
| 132 |
The design and performance of high-level language primitives for distributed programmingLeBlanc, Thomas John. January 1900 (has links)
Thesis (Ph. D.)--University of Wisconsin--Madison, 1982. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 112-115).
|
| 133 |
Profinite solutions for recursive domain equationsGunter, Carl A. January 1900 (has links)
Thesis (Ph. D.)--University of Wisconsin--Madison, 1985. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 170-182).
|
| 134 |
A methodology for mapping programming languages to programming problems /Michlowitz, Jason Lawrence, January 2006 (has links)
Thesis (M.S.)--Texas State University-San Marcos, 2006. / Vita. Appendices: leaves 152-237. Includes bibliographical references (leaves 238-240).
|
| 135 |
A methodology for mapping programming languages to programming problemsMichlowitz, Jason Lawrence, January 2006 (has links)
Thesis (M.S.)--Texas State University-San Marcos, 2006. / Vita. Appendices: leaves 152-237. Includes bibliographical references (leaves 238-240).
|
| 136 |
Foundation and applications of visual languages /Kong, Jun. January 2005 (has links)
Thesis (Ph.D.)--University of Texas at Dallas, 2005. / Includes vita. Includes bibliographical references (leaves 190-206)
|
| 137 |
Architecture for a low-level functional specification language supporting multimodeling and simulationLee, Jinho. January 2005 (has links)
Thesis (Ph. D.)--University of Florida, 2005. / Title from title page of source document. Document formatted into pages; contains 105 pages. Includes vita. Includes bibliographical references.
|
| 138 |
SPQL : the design of a relational preference query language /Ning, Wei. January 2005 (has links)
Thesis (M.Sc.)--York University, 2005. Graduate Programme in Computer Science. / Typescript. Includes bibliographical references (leaves 123-126). Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL: http://gateway.proquest.com/openurl?url%5Fver=Z39.88-2004&res%5Fdat=xri:pqdiss &rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&rft_dat=xri:pqdiss:MR11872
|
| 139 |
Formal specification and verification of a JVM and its bytecode verifierLiu, Hanbing, January 1900 (has links) (PDF)
Thesis (Ph. D.)--University of Texas at Austin, 2006. / Vita. Includes bibliographical references.
|
| 140 |
Computational techniques applied to group presentationsRutherford, Kevin January 1989 (has links)
Designs for a collection of re-usable software modules are developed. The modules are implemented in C and expressed in a tool-kit for the Unix operating system. Each tool is an expert in some aspect of the manipulation by computer of group presentations. The granularity of the tool-kit has been chosen so that common usages of the Todd-Coxeter and Reidemeister-Schreier methods can be expressed in various ways using any tool composition language (eg. shell scripts), and running as a collection of co-operating processes. Data file formats for the interchange of group-theoretic information between processes are described. The tools are tested on well-known examples, and are used to prove a long-standing conjecture. Use of the tools as the basis for a rule-based "expert system" is discussed.
|
Page generated in 0.0507 seconds