• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 669
  • 161
  • 108
  • 62
  • 19
  • 19
  • 19
  • 19
  • 19
  • 18
  • 14
  • 7
  • 6
  • 6
  • 6
  • Tagged with
  • 1184
  • 1184
  • 218
  • 185
  • 171
  • 169
  • 163
  • 159
  • 158
  • 135
  • 135
  • 128
  • 114
  • 107
  • 87
  • 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.
31

Benchmark generation in a new framework /

Li, Xi. January 2007 (has links)
Thesis (Ph.D.)--Hong Kong University of Science and Technology, 2007. / Includes bibliographical references (leaves 85-90). Also available in electronic version.
32

Global optimization of chemical process networks for resource recovery and power generation

Martin, Lealon LeCorte. January 2002 (has links) (PDF)
Thesis (Ph.D.)--University of California, Los Angeles, 2002. / Chair: Vasilios I. Manousiouthakis. Includes bibliographical references.
33

Join-order optimization with Cartesian products

Vance, Bennet 01 1900 (has links) (PDF)
Ph.D. / Computer Science and Engineering / Join-order optimization plays a central role in the processing of relational database queries. This dissertation presents two new algorithms for join-order optimization: a deterministic, exhaustive-search algorithm, and a stochastic algorithm that is based on the deterministic one. The deterministic algorithm achieves new complexity bounds for exhaustive search in join-order optimization; and in timing tests, both algorithms are shown to run many times faster than their predecessors. In addition, these new, fast algorithms search a larger space of join orders than is customary in join-order optimization. Not only do they consider all the so-called bushy join orders, rather than just the left-deep ones, but-what is more unusual-they also consider all join orders that contain Cartesian products. The novel construction of these algorithms enables them to search a space including Cartesian products without paying the performance penalty that is conventionally associated with such a search.
34

Dynamic process optimization through adjoint formulations and constraint aggregation /

Bloss, Karl F., January 2000 (has links)
Thesis (Ph. D.)--Lehigh University, 2000. / Includes vita. Includes bibliographical references (leaves 108-114).
35

New algorithms for Quadratic Unconstrained Binary Optimization (QUBO) with applications in engineering and social sciences

Tavares, Gabriel. January 2008 (has links)
Thesis (Ph. D.)--Rutgers University, 2008. / "Graduate Program in Operations Research." Includes bibliographical references (p. 419-435).
36

Software engineering of a direct search package for nonlinear optimization /

Liarakos, Michael. January 2009 (has links)
Thesis (Honors)--College of William and Mary, 2009. / Includes bibliographical references (leaf 37). Also available via the World Wide Web.
37

An adaptive tabu search approach to cutting and packing problems

Harwig, John Michael, Barnes, J. Wesley, January 2003 (has links) (PDF)
Thesis (Ph. D.)--University of Texas at Austin, 2003. / Supervisor: J. Wesley Barnes. Vita. Includes bibliographical references. Available also from UMI Company.
38

Batch scheduling of two-machine limited-buffer flowshop with setup and removal times

Dai, Jianbin, January 2003 (has links) (PDF)
Thesis (Ph. D.)--School of Industrial and Systems Engineering, Georgia Institute of Technology, 2004. Directed by Chen Zhou. / Vita. Includes bibliographical references (leaves 87-90).
39

Algorithms for budgeted auctions and multi-agent covering problems

Goel, Gagan. January 2009 (has links)
Thesis (Ph.D)--Computing, Georgia Institute of Technology, 2010. / Committee Chair: Vazirani, Vijay; Committee Member: Kalai, Adam; Committee Member: Mihail, Milena; Committee Member: Tetali, Prasad; Committee Member: Thomas, Robin. Part of the SMARTech Electronic Thesis and Dissertation Collection.
40

Fixed point methods for loss networks /

Thompson, Mark Richard. January 2002 (has links) (PDF)
Thesis (Ph. D.)--University of Queensland, 2002. / Includes bibliographical references.

Page generated in 0.1529 seconds