- 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 431 to 440 of 1015 (0.074 seconds)Spelling suggestions: "subject:"computer program"" "subject:"coomputer program""
| 431 |
The design and implementation of a large scientific code using FORTRAN 90 /Reid, Darryl, January 2003 (has links)
Thesis (M.Sc.)--Memorial University of Newfoundland, 2003. / Bibliography: leaves 123-126. Also available online.
|
| 432 |
Idact transformation managerHay, Brian. January 2005 (has links) (PDF)
Thesis (Ph. D.)--Montana State University--Bozeman, 2005. / Typescript. Chairperson, Graduate Committee: Michael Oudshoorn. Includes bibliographical references (leaves 95-103).
|
| 433 |
Development of a content management system (CMS) for a small polling organizationBlokhina, Natalia. January 2006 (has links) (PDF)
Thesis (M.S.C.I.T.)--Regis University, Denver, Colo., 2006. / Title from PDF title page (viewed on Aug. 30, 2006). Includes bibliographical references.
|
| 434 |
Testing concurrent Java components /Long, Bradley. January 2005 (has links) (PDF)
Thesis (Ph.D.) - University of Queensland, 2005. / Includes bibliography.
|
| 435 |
Implementation of some finite difference methods for the pricing of derivatives using C++ programmingAmpadu, Ebenezer. January 2007 (has links)
Thesis (M.S.) -- Worcester Polytechnic Institute. / Keywords: Finite Difference; Pricing; C++. Includes bibliographical references (leaf 21).
|
| 436 |
Integrating a universal query mechanism into Java /Robinson, Aaron R. January 2007 (has links)
Thesis (M.S.)--Rochester Institute of Technology, 2007. / Typescript. Includes bibliographical references (leaves 47-48).
|
| 437 |
GpuPy : efficiently using a GPU with PythonEitzen, Benjamin. January 2007 (has links) (PDF)
Thesis (M.S.)--Washington State University, August 2007. / Includes bibliographical references (p. 49-51).
|
| 438 |
Analysis through reflection : walking the EMF model of BPEL4WS /Huynh, Kien Kim. January 2005 (has links)
Thesis (M.Sc.)--York University, 2005. Graduate Programme in Computer Science. / Typescript. Includes bibliographical references (leaves 190-198). 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:MR11816
|
| 439 |
QUICKTALK : a Smalltalk-80 dialect for defining primitive methods /Ballard, Mark B., January 1986 (has links)
Thesis (Ph. D.) Oregon Graduate Center.
|
| 440 |
Estimating the cost of graphlog queriesEscalante Osuna, Carlos 02 August 2018 (has links)
This dissertation develops a cost model for a particular implementation of the database query language GraphLog. The order in which the subgoals of a GraphLog query are executed has a major effect on the total processing time. Our model may be used to compare the expected execution costs for different orderings of the same general query, thus, allowing us to select an efficient execution plan. We describe two cost models: one that is tailored to a specific architecture and another that is more general. Both models assume a top-down evaluation strategy. In particular, we address the issue of how to handle recursive predicates. We also provide some experimental results that confirm the validity of our work. / Graduate
|
Page generated in 0.0787 seconds