• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 98
  • 40
  • 5
  • 3
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • Tagged with
  • 179
  • 179
  • 55
  • 45
  • 39
  • 37
  • 25
  • 23
  • 23
  • 20
  • 19
  • 16
  • 16
  • 15
  • 15
  • 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.
71

Design space pruning heuristics and global optimization method for conceptual design of low-thrust asteroid tour missions

Alemany, Kristina. January 2009 (has links)
Thesis (Ph.D)--Aerospace Engineering, Georgia Institute of Technology, 2010. / Committee Chair: Braun, Robert; Committee Member: Clarke, John-Paul; Committee Member: Russell, Ryan; Committee Member: Sims, Jon; Committee Member: Tsiotras, Panagiotis. Part of the SMARTech Electronic Thesis and Dissertation Collection.
72

Ein kombinatorisches Beweisverfahren für produktrelationen zwischen Gauss-summen über endlichen kommutativen Ringen

Petin, Burkhard. January 1990 (has links)
Thesis (Doctoral)--Rheinische Friedrich-Wilhelms-Universtät Bonn, 1990. / Includes bibliographical references.
73

Algebraische und kombinatorische Aspekte der Harder-Narasimhan-Rekursion und ihrer Umkehrung

Mersmann, Gerd. January 1999 (has links)
Thesis (doctoral)--Bonn, 1998. / Includes bibliographical references (p. [273]-[274]).
74

Interpreting tables in text using probabilistic two-dimensional context-free grammars /

Lee, Wing Kuen. January 2005 (has links)
Thesis (M.Phil.)--Hong Kong University of Science and Technology, 2005. / Includes bibliographical references (leaves 82-84). Also available in electronic version.
75

Lower bound methods for multiparty communication complexity

Ford, Jeffrey Stephen, January 1900 (has links) (PDF)
Thesis (Ph. D.)--University of Texas at Austin, 2006. / Vita. Includes bibliographical references.
76

Adsorbing staircase walks models of polymers in the square lattice /

Ye, Lu. January 2005 (has links)
Thesis (M.Sc.)--York University, 2005. Graduate Programme in Mathematics and Statistics. / Typescript. Includes bibliographical references (leaves 99-102). 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:MR11932
77

Periods, partial words, and an extension of a result of Guibas and Odlyzko

Shirey, Brian. January 1900 (has links) (PDF)
Thesis (M.S.)--University of North Carolina at Greensboro, 2007. / Title from PDF title page screen. Advisor: Francine Blanchet-Sadri; submitted to the Dept. of Computer Science. Includes bibliographical references (p. 70-73).
78

On comparability of random permutations

Hammett, Adam Joseph, January 2007 (has links)
Thesis (Ph. D.)--Ohio State University, 2007. / Title from first page of PDF file. Includes bibliographical references (p. 115-119).
79

On Factors of Rank One Subshifts

Ziegler, Caleb 05 1900 (has links)
Rank one subshifts are dynamical systems generated by a regular combinatorial process based on sequences of positive integers called the cut and spacer parameters. Despite the simple process that generates them, rank one subshifts comprise a generic set and are the source of many counterexamples. As a result, measure theoretic rank one subshifts, called rank one transformations, have been extensively studied and investigations into rank one subshifts been the basis of much recent work. We will answer several open problems about rank one subshifts. We completely classify the maximal equicontinuous factor for rank one subshifts, so that this factor can be computed from the parameters. We use these methods to classify when large classes of rank one subshifts have mixing properties. Also, we completely classify the situation when a rank one subshift can be a factor of another rank one subshift.
80

Maximal (0,1,2,...t)-cliques of some association schemes /

Choi, Sul-young January 1985 (has links)
No description available.

Page generated in 0.0872 seconds