NDLTD Global ETD Search
  • Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 4200
  • 1250
  • 510
  • 267
  • 200
  • 119
  • 91
  • 46
  • 45
  • 45
  • 45
  • 45
  • 45
  • 43
  • 35
  • Tagged with
  • 8422
  • 2437
  • 1620
  • 1143
  • 1111
  • 1108
  • 1053
  • 983
  • 927
  • 919
  • 875
  • 806
  • 734
  • 569
  • 527
  • 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 81 to 90 of 8422 (0.025 seconds)
81

What algorithms could not be

Dean, Walter H. January 2007 (has links)
Thesis (Ph. D.)--Rutgers University, 2007. / "Graduate Program in Philosophy." Includes bibliographical references (p. 360-368).
Philosophy. Algorithms.
82

A comparison of task scheduling algorithms on multicomputers /

Shin, Chae Young. January 1994 (has links)
Thesis (M.S.)--Oregon State University, 1995. / Typescript (photocopy). Includes bibliographical references (leaves 34-35). Also available via the World Wide Web.
Multiprocessors. Algorithms.
83

Degree sequence polyhedra and separation algorithms.

Zhang, Fan, Carleton University. Dissertation. Mathematics. January 1992 (has links)
Thesis (Ph. D.)--Carleton University, 1992. / Also available in electronic format on the Internet.
Polyhedra. Algorithms.
84

Handling worst case in skyline /

Jain, Romil. January 2009 (has links)
Thesis (M.Sc.)--York University, 2009. Graduate Programme in Computer Science. / Typescript. Includes bibliographical references (leaves 83-84). Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL: http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&res_dat=xri:pqdiss&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&rft_dat=xri:pqdiss:MR51543
Algorithms. Heuristic.
85

Quad general tree drawing algorithm and general trees characterization : towards an environment for the experimental study on general tree drawing algorithms /

Yao, Chu. January 2008 (has links)
Thesis (M.S.)--Rowan University, 2008. / Typescript. Includes bibliographical references.
Algorithms. Trees
86

Linear-size indexes for approximate pattern matching and dictionary matching

Tam, Siu-lung, January 2010 (has links)
Thesis (Ph. D.)--University of Hong Kong, 2010. / Includes bibliographical references (leaves 108-115). Also available in print.
Computer algorithms.
87

Vehicle routing for heterogeneous fleet

Hung, Hing-fai, Daniel. January 1992 (has links)
Thesis (M.Phil.)--University of Hong Kong, 1992. / Also available in print.
Transportation Algorithms.
88

Map labeling with circles

Jiang, Minghui. January 2005 (has links) (PDF)
Thesis (Ph. D.)--Montana State University--Bozeman, 2005. / Typescript. Chairperson, Graduate Committee: Binhai Zhu. Includes bibliographical references (leaves 69-73).
Algorithms. Cartography.
89

Algorithms for exact polynomial root calculation

Heindel, Lee E. January 1970 (has links)
Thesis (Ph. D.)--University of Wisconsin--Madison, 1970. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliography.
Algorithms. Polynomials.
90

The crossing number of a graph in the plane /

Winterbach, Wynand. January 2005 (has links)
Thesis (MSc)--University of Stellenbosch, 2005. / Bibliography. Also available via the Internet.
Graph algorithms.

Page generated in 0.0318 seconds