NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 734
  • 269
  • 129
  • 52
  • 19
  • 14
  • 11
  • 6
  • 4
  • 4
  • 4
  • 4
  • 3
  • 3
  • 2
  • Tagged with
  • 1474
  • 668
  • 257
  • 243
  • 241
  • 240
  • 186
  • 182
  • 174
  • 167
  • 159
  • 150
  • 143
  • 141
  • 108
  • 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 1474 (0.025 seconds)
61

Fractionally total colouring most graphs

Meagher, Conor John. January 1900 (has links)
Thesis (M.Sc.). / Title from title page of PDF (viewed 2008/01/30). Written for the School of Computer Science. Includes bibliographical references.
62

CPGA : a two-dimensional order-based algorithm for cell placement /

Cooklis, John T. January 1991 (has links)
Thesis (M.S.)--Rochester Institute of Technology, 1991. / Spine title: A genetic algorithm for cell placement. Typescript. Includes bibliographical references.
Combinatorial optimization. Algorithms.
63

Algorithms for bivariate zonoid depth /

Gopala, Harish, January 1900 (has links)
Thesis (M.C.S.)--Carleton University, 2004. / Includes bibliographical references (p. 27-29). Also available in electronic format on the Internet.
64

An examination of pattern matching algorithms for intrusion detection systems /

Kelly, James. January 1900 (has links)
Thesis (M.C.S.) - Carleton University, 2006. / Includes bibliographical references (p. 186-196). Also available in electronic format on the Internet.
65

Reproducing color images with custom inks /

Stollnitz, Eric J. January 1998 (has links)
Thesis (Ph. D.)--University of Washington, 1998. / Vita. Printed examples in pocket. Includes bibliographical references (p. [87]-92).
66

A reformulation-linearization based implicit enumeration algorithm for the rectilinear distance location-allocation problem /

Ramachandran, Sridhar, January 1991 (has links)
Thesis (M.S.)--Virginia Polytechnic Institute and State University, 1991. / Vita. Abstract. Includes bibliographical references (leaves 75-77). Also available via the Internet.
Combinatorial enumeration problems
67

Enclosings of small cycle systems

Newman, Nicholas, January 2009 (has links)
Thesis (Ph. D.)--Auburn University, 2009. / Abstract. Vita. Includes bibliographical references (p. 44-45).
Steiner systems. Combinatorial analysis.
68

The intersection problem for Latin squares with holes of size 2 and 3

Baker, Charla, Lindner, Charles C., January 2009 (has links)
Thesis (Ph. D.)--Auburn University, 2009. / Abstract. Vita. Includes bibliographical references (p. 155).
Magic squares. Combinatorial analysis.
69

Bottleneck problems in combinatorics and optimization

Leung, Pak-kin, Richard, January 1998 (has links)
Thesis (M. Phil.)--University of Hong Kong, 1999. / Also available in print.
70

Existence and construction of real-valued equiangular tight frames

Redmond, Daniel Joseph. Casazza, Peter G., January 2009 (has links)
Title from PDF of title page (University of Missouri--Columbia, viewed on Feb 24, 2010). The entire thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file; a non-technical public abstract appears in the public.pdf file. Dissertation advisor: Dr. Peter Casazza. Vita. Includes bibliographical references.
Frames (Combinatorial analysis)

Page generated in 0.0302 seconds