- 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 531 to 540 of 1396 (0.45 seconds)| 531 |
Improved shortest path algorithms by dynamic graph decomposition : a thesis submitted in partial fulfilment of the requirements for the degree of Master of Science in Computer Science and Software Engineering in the University of Canterbury /Tian, Lin. January 2006 (has links)
Thesis (M. Sc.)--University of Canterbury, 2006. / Typescript (photocopy). Includes bibliographical references (p. 77-79). Also available via the World Wide Web.
|
| 532 |
Algorithms for multiple sequence alignment, comparison of trees, and Steiner trees.Wang, Lusheng. Jiang, Tao. Unknown Date (has links)
Thesis (Ph.D.)--McMaster University (Canada), 1995. / Source: Dissertation Abstracts International, Volume: 57-03, Section: B, page: 2045. Adviser: T. Jiang.
|
| 533 |
Using determinant and cycle basis schemes in genetic algorithms for graph and network applications /Abuali, Faris Nabih. January 1995 (has links)
Thesis (Ph.D.)--University of Tulsa, 1995. / Includes bibliographical references (leaves 118-121).
|
| 534 |
Connectivity properties of Archimedean and Laves lattices /Parviainen, Robert, January 2004 (has links)
Diss. (sammanfattning) Uppsala : Univ., 2004. / Härtill 6 uppsatser.
|
| 535 |
Simplicial complexes of graphs /Jonsson, Jakob. January 2008 (has links) (PDF)
Univ., Diss.--Stockholm, 2005. / Includes bibliographical references (p. [361] - 369) and index.
|
| 536 |
Scene matching between a quantitative map and a qualitative hand drawn sketchParekh, Gaurav. January 2007 (has links)
Thesis (M.S.)--University of Missouri-Columbia, 2007. / The entire dissertation/thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file (which also appears in the research.pdf); a non-technical general description, or public abstract, appears in the public.pdf file. Title from title screen of research.pdf file (viewed on November 12, 2008) Includes bibliographical references.
|
| 537 |
Skew Hadamard difference sets, strongly regular graphs and bent functionsWang, Zeying. January 2009 (has links)
Thesis (Ph.D.)--University of Delaware, 2008. / Principal faculty advisor: Qing Xiang, Dept. of Mathematical Sciences. Includes bibliographical references.
|
| 538 |
Partitioning planar graphs with costs and weights /Guo, Hua, January 1900 (has links)
Thesis (M.Sc.) - Carleton University, 2002. / Includes bibliographical references (p. 93-97). Also available in electronic format on the Internet.
|
| 539 |
A linear algebra approach to synchronizing automata /Arnold, Fredrick C., January 1900 (has links)
Thesis (M. Sc.)--Carleton University, 2005. / Includes bibliographical references (p. 47-48). Also available in electronic format on the Internet.
|
| 540 |
The application of atheoretical regression trees to problems in time series analysis : a thesis submitted in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Mathematics, Department of Mathematics and Statistics, University of Canterbury /Rea, William S. January 2008 (has links)
Thesis (Ph. D.)--University of Canterbury, 2008. / Typescript (photocopy). Includes bibliographical references (leaves 265-282). Also available via the World Wide Web.
|
Page generated in 0.4538 seconds