Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 30 for “"Cluster Algorithm"”.

  1. Waste collection & street-sweeping route optimization using a 2-stage cluster algorithm & heuristic approaches

    … The following thesis proposes a novel 2-stage clustering approach, namely the Static and Dynamic Clustering, to divide a municipalities road network into several operational areas in which the routes can be assigned. A method of generating optimal routes within the respective operational areas …

    uoit Repository record for Waste collection & street-sweeping route optimization using a 2-stage cluster algorithm & heuristic approaches (opens in a new tab)

  2. Computational Study of Colloids in Suspension: Effective Interactions and Phase Transitions

    … that further progress will critically depend on algorithmic advances. One of the main results in my Ph.D study is the development of a novel Monte Carlo method that alleviates this slow-down problem. The so-called generalized geometric cluster algorithm applies geometric transformations to …

    uiuc Repository record for Computational Study of Colloids in Suspension: Effective Interactions and Phase Transitions (opens in a new tab)

  3. OVERLAP MEASUREMENT OF INFINITE DIMENSIONAL QUANTUM STATES AND BOSONIC LEARNING MACHINE WITH TRAPPED IONS

    … implement two quantum machine learning algorithms: the supervised k-NN and unsupervised K-means cluster algorithm. We first correctly group the 15 unlabeled quantum states into three clusters in three iterations of the K-means cluster algorithm. Next, the k-NN algorithm uses the …

    nus Repository record for OVERLAP MEASUREMENT OF INFINITE DIMENSIONAL QUANTUM STATES AND BOSONIC LEARNING MACHINE WITH TRAPPED IONS (opens in a new tab) Download file for OVERLAP MEASUREMENT OF INFINITE DIMENSIONAL QUANTUM STATES AND BOSONIC LEARNING MACHINE WITH TRAPPED IONS (opens in a new tab)

  4. Efficient dynamic load balancing techniques for large scale distributed simulations on a grid infrastructure

    … execution time. Furthermore, we extend our algorithm from a local intra-cluster algorithm to a global inter-cluster algorithm and we consider studying the proposed global design through a formalized Discrete Event System Specification (DEVS) model system.

    ottawa-retro Repository record for Efficient dynamic load balancing techniques for large scale distributed simulations on a grid infrastructure (opens in a new tab)

  5. LR 2012-2016 m. kadencijos Seimo narių ir plenarinių posėdžių balsavimų klasterinė analizė /

    … According to the Parliament vote data 4 clusters are made. One cluster shows different opinion between position and opposition groups. This cluster is decomposed to Parlament member votes and clustering algorithm applied in order to indentify he differencies between theoretical and …

    vilnius Repository record for LR 2012-2016 m. kadencijos Seimo narių ir plenarinių posėdžių balsavimų klasterinė analizė / (opens in a new tab)

  6. Indoor Radio Dot Placement Optimization using UE Positioning and K-Means Clustering

    … to quantitatively evaluate radio dot adjustment algorithms that can better accommodate for cost-effective performance solutions. The number of UEs and their distribution are simulated, with the Machine Learning (ML) cluster algorithm of K-means being used to evaluate the ideal scenario where all …

    carleton Repository record for Indoor Radio Dot Placement Optimization using UE Positioning and K-Means Clustering (opens in a new tab)

  7. A Minimum Entropy Approach to Biclustering and Application to Mine Microarray Gene Expression Data

    Biclustering is the process of discovering subsets of the original data where the features and objects have a high correlation. We present new method for biclustering, based on a combination of the minimum entropy clustering algorithm and the mean squared residue score. This approach uses the …

    marquette Repository record for A Minimum Entropy Approach to Biclustering and Application to Mine Microarray Gene Expression Data (opens in a new tab)

  8. Magnetic frustration in three dimensions

    … have limited applicability, approaches based on cluster expansions are promising alternatives. By design, they do not suffer from dimensionality or frustration and generate reliable insights into the thermodynamic limit without any restriction in the parameter space. This thesis makes significant …

    qucosa-diss

  9. Applications of Spin Glasses across Disciplines: From Complex Systems to Quantum Computing and Algorithm Development

    … applications in other disciplines and spin glass algorithms. Spin glasses are magnetic systems with disorder and frustration, and the essential physics of spin glasses lies not in the details of their microscopic interactions but rather in the competition between quenched ferromagnetic and …

    tamu Repository record for Applications of Spin Glasses across Disciplines: From Complex Systems to Quantum Computing and Algorithm Development (opens in a new tab)

  10. A STUDY OF QUANTUM ANNEALING DEVICES FROM A CLASSICAL PERSPECTIVE

    … problems. As such, developing and improving algorithms and methods to study these computationally complex systems is of paramount importance to many disciplines. This body of work attempts to attack the problem of solving combinatorial optimization problems by simulating spin glasses from …

    tamu Repository record for A STUDY OF QUANTUM ANNEALING DEVICES FROM A CLASSICAL PERSPECTIVE (opens in a new tab)

  11. Quantum Critical Phenomena of Relativistic Fermions in 1+1d and 2+1d

    … We confirm these results using the meron-cluster algorithm, and locate the critical point precisely using exact diagonalization based on the spectrum of the Wess-Zumino-Witten model. In two spatial dimensions, we analyze the model using $\varepsilon$ expansion, large $N_f$ expansion and …

    duke Repository record for Quantum Critical Phenomena of Relativistic Fermions in 1+1d and 2+1d (opens in a new tab)

  12. Structural properties and phase behavior in colloidal suspensions

    … to study this system, I extended the geometric cluster algorithm to efficiently simulate systems interacting through the Coulomb potential. In Chapter 5 computer simulations are employed to elucidate the experimentally observed crystal phases of the Q and MS-2 virus particles in solution with …

    uiuc Repository record for Structural properties and phase behavior in colloidal suspensions (opens in a new tab)

  13. Evaluation of clustering results and novel cluster algorithms

    Cluster analysis is frequently performed in many application fields to find groups in data. For example, in medicine, researchers have used gene expression data to cluster patients suffering from a particular disease (e.g., breast cancer), in order to detect new disease subtypes. Many cluster …

    lmu-germany Repository record for Evaluation of clustering results and novel cluster algorithms (opens in a new tab)

  14. Low-Rank Tensor Approximation in post Hartree-Fock Methods

    … Furthermore, the AO-MO transformation and a MP2 algorithm with decomposed tensors in the CP format is evaluated and the scaling with increasing system and basis set size is investigated. Finally, a Coupled-Cluster algorithm based only on low-rank CP representation of the MO integrals is …

    qucosa-diss

  15. Theoretical Analysis of Biomolecular Systems: Computational Simulations, Core-set Markov State Models, Clustering, Molecular Docking

    … this thesis, it is discussed how density-based cluster algorithms can be used to determine these core sets, and the application on linear and cyclic peptides is highlighted. The performance of a promising cluster algorithm is investigated and error sources in the construction of the Markov …

    fu-berlin Repository record for Theoretical Analysis of Biomolecular Systems: Computational Simulations, Core-set Markov State Models, Clustering, Molecular Docking (opens in a new tab)

  16. Modellierung von Flächendatensätzen der Oberflächentemperatur, Strahlungsbilanz und Kaltluftproduktion in windschwachen Strahlungsnächten

    … were likewise considered. Based on a fuzzy -cluster algorithm approach, the correlation between the synthetic pattern derived from a DTM in combination with the landuse and the surface temperature of the satellite image is r = 0.74. <br>The synthetic pattern of the radiation temperature is …

    freiburg-diss Repository record for Modellierung von Flächendatensätzen der Oberflächentemperatur, Strahlungsbilanz und Kaltluftproduktion in windschwachen Strahlungsnächten (opens in a new tab)

  17. Exploration and Comparison of Image-Based Techniques for Strawberry Detection

    … background pixels. Thus, the color-based K-mean cluster algorithm to detect red strawberries will be exploited. Finally, it achieves a 90.5% truth-positive rate for detecting red strawberries. For detecting the unripe strawberry, this thesis first trained the Support Vector Machine classifier …

    calpoly Repository record for Exploration and Comparison of Image-Based Techniques for Strawberry Detection (opens in a new tab)

  18. Αλλαγές φάσης στο πρότυπο Baxter-Wu

    … we also develop a new Wolff-Niedermayer type cluster algorithm, which improves considerably the simulations at critical points. Such algorithms have already being used widely for the Ising model. We use it for studying the characteristic energy and magnetic properties of the critical phase …

    greece Repository record for Αλλαγές φάσης στο πρότυπο Baxter-Wu (opens in a new tab)

  19. Piecewise-deterministic Markov chain Monte Carlo

    … processes has led to several new and promising algorithmic developments. Prominent examples include the zig-zag process and the bouncy particle sampler. We explore this class of algorithms, proposing extensions and drawing connections to existing literature.</p> <p>Two key aspects of a …

    oxford Repository record for Piecewise-deterministic Markov chain Monte Carlo (opens in a new tab)

  20. To Shift or Not To Shift: Maximizing the Efficiency of a Wireless Sensor Network Using Multiple Sinks

    … a technique in which we have created called the Cluster Algorithm for Sink Selection (CASS). With these techniques we intend to extend the life of the network and also keep the cost of the network down.

    usm Repository record for To Shift or Not To Shift: Maximizing the Efficiency of a Wireless Sensor Network Using Multiple Sinks (opens in a new tab)

Page 1 of 2