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 14 of 14 for “"Algorithm theory"”.

  1. A parameterized Douglas-Rachford algorithm : theory and applications

    Douglas-Rachford algorithm is important due to its applications on the Heron problem and on the image denoising. Mathematically, it can be considered as finding a point such that the point belongs to a zero set of the sum of two maximally monotone operators. In this thesis, previous work on …

    ubc Repository record for A parameterized Douglas-Rachford algorithm : theory and applications (opens in a new tab) Download PDF for A parameterized Douglas-Rachford algorithm : theory and applications (opens in a new tab)

  2. Libraries and values Building trust in Swedish public libraries through transparency

    … this backdrop. This is done using critical algorithm theory on transparency, to improve the possibilities, for the public, of knowing how Swedish small to medium sized public libraries collections of books are created (via the libraries’ process of purchasing). 13 interviews and six …

    chalmers Repository record for Libraries and values Building trust in Swedish public libraries through transparency (opens in a new tab)

  3. Testing effectiveness of genetic algorithms for exploratory data analysis

    … of DaMI (Data Mining Initiative), a genetic algorithm designed to mine the CCEP (Comprehensive Clinical Evaluation Program) database in the search for a Persian Gulf War syndrome, proposed a method to overcome this weakness: reproducibility -- the conjecture that consistent convergence on the …

    nps Repository record for Testing effectiveness of genetic algorithms for exploratory data analysis (opens in a new tab)

  4. Dissecting multiple sequence alignment methods

    … thesis we dissected and analyzed the crucial algorithms and data structures required to construct such a multiple alignment. Based upon that dissection, we present a novel graph-based multiple sequence alignment program and a new method for multi-read alignments occurring in assembly projects. …

    fu-berlin Repository record for Dissecting multiple sequence alignment methods (opens in a new tab)

  5. On improved methods for monotone CFD solution accuracy

    … The goal is to work towards a generalized algorithm that extracts the "best" solution out of an affordable "<i>optimal</i>” mesh. By optimal, we mean utilizing the <i>least number</i> of degrees of freedom possible for achieving ||<i>u</i> — <i>u<sub>h,p</sub></i>|| ≤ ε, where ε is a small …

    utk-theses Repository record for On improved methods for monotone CFD solution accuracy (opens in a new tab)

  6. Αποκεντρωμένος έλεγχος διαχείρισης διεσπαρμένων ενεργειακών πόρων στα δίκτυα διανομής για παροχή επικουρικών υπηρεσιών

    … thesis focuses on the following topics: i) the theory of peers and gossip algorithms have been introduced into electricity distribution grids, and the acceleration of gossip algorithms’ convergence has been approached via the mathematical graph analysis, ii) gossip algorithms have been proposed …

    greece Repository record for Αποκεντρωμένος έλεγχος διαχείρισης διεσπαρμένων ενεργειακών πόρων στα δίκτυα διανομής για παροχή επικουρικών υπηρεσιών (opens in a new tab)

  7. Computational and practical developments in single- and multi-component inverse scattering series internal multiple prediction

    … Implementations of instances of this algorithm in any one of the applicable transform domains encounter computational challenges and challenges caused by the practicalities of field data. In this thesis I systematically examine, develop and refine inverse scattering series internal …

    calgary Repository record for Computational and practical developments in single- and multi-component inverse scattering series internal multiple prediction (opens in a new tab)

  8. Alternative Approaches for Analysis of Bin Packing and List Update Problems

    In this thesis we introduce and evaluate new algorithms and models for the analysis of online bin packing and list update problems. These are two classic online problems which are extensively studied in the literature and have many applications in the real world. Similar to other online problems, …

    waterloo Repository record for Alternative Approaches for Analysis of Bin Packing and List Update Problems (opens in a new tab)

  9. Process Control in High-Noise Environments Using A Limited Number Of Measurements

    … development, and evaluation of novel hybrid algorithms for process control that use a limited number of measurements and that are suitable to operate in the presence of large amounts of process noise. As an initial step, affine and neural network statistical process models are developed in …

    gatech Repository record for Process Control in High-Noise Environments Using A Limited Number Of Measurements (opens in a new tab)

  10. Theory and computation of sparse cutting planes

    Cutting plane plays an important role in the theory and computation of integer programming. Nowadays, most state-of-the-art integer programming solvers tend to bias their cutting plane selection towards sparse ones, which emphasizes the significance of sparse cutting planes. In this thesis, we …

    gatech Repository record for Theory and computation of sparse cutting planes (opens in a new tab)

  11. Genetické algoritmy

    Obsahem práce je seznámení se s problematikou genetických algoritmů. V práci je rozebrána teorie složitosti úloh a na ni navazující teoretické základy genetických algoritmů. Následuje podrobné rozebrání tří řešených úloh - úloha obchodního cestujícího, problém baťohu a vývoj herního algoritmu pro …

    brno-tech Repository record for Genetické algoritmy (opens in a new tab)

  12. Software Specialization as Applied to Computational Algebra

    … problems. In this thesis we employ Buchberger's algorithm for finding Groebner bases by tailoring specialized instances of Buchberger's algorithm via code generation. We introduce a framework for meta programming and code generation in the F# programming language that removes the abstraction …

    mcmaster Repository record for Software Specialization as Applied to Computational Algebra (opens in a new tab)

  13. Computational and Structural Approaches to Periodicities in Strings

    <p>We investigate the function ρ<sub><em>d</em></sub>(<em>n</em>) = max { <em>r</em>(<em><strong>x</strong></em>) | <em><strong>x</strong></em> is a (<em>d</em>, <em>n</em>)-string } where <em>r</em>(<em><strong>x</strong></em>) is the number of runs in the string <em><strong>x</strong></em>, and a …

    mcmaster Repository record for Computational and Structural Approaches to Periodicities in Strings (opens in a new tab)