• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1535
  • 641
  • 223
  • 199
  • 191
  • 128
  • 90
  • 70
  • 56
  • 51
  • 47
  • 44
  • 41
  • 28
  • 16
  • Tagged with
  • 3755
  • 1215
  • 413
  • 291
  • 283
  • 271
  • 263
  • 226
  • 223
  • 193
  • 189
  • 182
  • 176
  • 172
  • 169
  • 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.
1

Resource handling in a cluster environment

Dalhaug, Morten January 2006 (has links)
No description available.
2

Resource handling in a cluster environment

Dalhaug, Morten January 2006 (has links)
No description available.
3

Phase transitions in magnetic clusters and other finite systems

Stamerjohanns, Heinrich Wilhelm. January 2001 (has links)
Oldenburg, Univ., Diss., 2001. / Dateiformat: zip, Dateien im PDF-Format. Computerdatei im Fernzugriff.
4

Phase transitions in magnetic clusters and other finite systems

Stamerjohanns, Heinrich Wilhelm. January 2001 (has links)
Oldenburg, Univ., Diss., 2001. / Dateiformat: zip, Dateien im PDF-Format. Computerdatei im Fernzugriff.
5

Charakterisierung kleiner Aromaten-Cluster mit der excited state-Photoelektronenspektroskopie

Eisenhardt, Christoph G. January 2000 (has links)
Berlin, Freie Universiẗat, Diss., 2000. / Dateiformat: zip, Dateien im PDF-Format.
6

Phase transitions in magnetic clusters and other finite systems

Stamerjohanns, Heinrich Wilhelm. January 2001 (has links)
Oldenburg, University, Diss., 2001. / Dateiformat: zip, Dateien im PDF-Format.
7

Spektroskopie und ab initio Rechnungen an H-verbrückten und van der Waals Clustern /

Bürgi, Thomas January 1995 (has links)
Diss. Naturwiss. Bern (kein Austausch). / Beiträge engl. oder dt. Mit Sonderdrucken. Literaturverz.
8

From scenario association to categorical data clustering /

Pan, Yuanyi. January 2005 (has links)
Thesis (M.Sc.)--York University, 2005. Graduate Programme in Mathematics and Statistics. / Typescript. Includes bibliographical references (leaves 61-62). 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:MR11874
9

The effects of clustering on the medium and large-scale capacitated location-routing problem

Buhrmann, Jacoba Hendrina 26 July 2016 (has links)
A thesis submitted to the Faculty of Engineering and the Built Environment, University of the Witwatersrand, Johannesburg, in fulfilment of the requirements for the degree of Doctor of Philosophy. February 23, 2016 / This work investigates the effectiveness of using clustering methods in solving various capacitated location-routing problems (CLRP) for medium- and large-scale datasets, with up to 20 000 datapoints. Different clustering methods as well as hybrid clustering methods are tested and compared. A new problem called the planar CLRP (plCLRP) is introduced. Based on the results from the clustering methods, cluster-based approaches are suggested to solve variants of the CLRP. These include the Hamiltonian p–median problem (HpMP), the planar CLRP (plCLRP), the concentrator discrete CLRP (cdCLRP) and the standard discrete CLRP (sdCLRP). A new method called the two-phased proportional regret ordering based unconstrained to constrained (PROBUC) method is also proposed to create capacitated clusters. The focus falls on finding effective non-exponential time algorithms that can be used to solve large-scale problems with good results. A full set of results for each problem are presented and comparisons are made with known results from the literature where possible. The PLRP (periodic location-routing problem) introduced by Prodhon and Prins (2008), is also investigated. A change in the current problem formulation, as provided by Prodhon (2011), is proposed to enforce single-source constraints across time horizon and limit the maximum number of vehicles. An approach to solve the PLRP, based on the cluster-based approaches to solve the discrete CLRPs, is suggested. The results of the cluster-based approach are compared to best-known solutions for existing PLRP instances given by Prodhon (2009a). A set of large scale PLRP instances are introduced, based on instances generated by Harks et al. (2013) for the sdCLRP.
10

"Cluster" headaches: A review of the literature

Barber, Bryan January 1961 (has links)
Thesis (M.D.)—Boston University

Page generated in 0.0562 seconds