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 486 for “"Approximation Algorithm"”.

  1. Accelerating Successive Approximation Algorithm Via Action Elimination

    … effort to improve the performance of successive approximation algorithm with a prime aim of solving finite states and actions, infinite horizon, stationary, discrete and discounted Markov Decision Processes (MDPs). Successive approximation is a simple and commonly used method to solve MDPs. …

    toronto-retro Repository record for Accelerating Successive Approximation Algorithm Via Action Elimination (opens in a new tab)

  2. An Approximation Algorithm Based Approach to Instruction Scheduling

    … overall execution times. In this thesis, a novel approximation-algorithm-based scheduler is introduced and a prototype is implemented for the IBM(c) z13(tm) processor. The algorithm is a modified version of Karger's minimum cut algorithm which is applied to a directed acyclic graph that defines …

    mcmaster Repository record for An Approximation Algorithm Based Approach to Instruction Scheduling (opens in a new tab)

  3. The Matching Augmentation Problem: A 7/4-Approximation Algorithm

    We present a 7/4 approximation algorithm for the matching augmentation problem (MAP): given a multi-graph with edges of cost either zero or one such that the edges of cost zero form a matching, find a 2-edge connected spanning subgraph (2-ECSS) of minimum cost. We first present a series of …

    waterloo Repository record for The Matching Augmentation Problem: A 7/4-Approximation Algorithm (opens in a new tab)

  4. A successive approximation algorithm to solve motion planning problems

    A successive approximation algorithm is presented to solve motion planning problems and optimal control problems. A motion planning problem is included in an optimal control problem and due to the heavily nonlinear and coulped differential equations describing the dynamics of the manipulator and …

    njit Repository record for A successive approximation algorithm to solve motion planning problems (opens in a new tab)

  5. An approximation algorithm for Demand Strip Packing with moldable jobs

    … Instead, research is focused on developing approximation algorithms which can find a solution that is “good enough” whilst running in polynomial time. In this thesis, we present an approximation algorithm for DSP with moldable jobs. The algorithm runs in polynomial time with respect to the …

    chalmers Repository record for An approximation algorithm for Demand Strip Packing with moldable jobs (opens in a new tab)

  6. An Efficient Randomized Approximation Algorithm for Volume Estimation and Design Centering

    … dieser Arbeit beschreiben wir die Konzepte des Algorithmus und seine einzelnen Schritte. Wir testen ihn dann anhand bekannter Vergleichsfälle und zeigen seine Anwendbarkeit in elektronischen und biologischen Systemen. In allen Fällen übertrifft das vorliegende Verfahren den bisherigen Stand der …

    qucosa-diss

  7. A Grid-Based Approximation Algorithm for the Minimum Weight Triangulation Problem

    … be NP-Hard. We present a novel polynomial-time algorithm that computes a 16-approximation of the minimum weight triangulation---a constant that is significantly smaller than what has been previously known. To construct our candidate solution, our algorithm uses grids to partition edges into …

    vt Repository record for A Grid-Based Approximation Algorithm for the Minimum Weight Triangulation Problem (opens in a new tab)

  8. An Approximation Algorithm for Character Compatibility and Fast Quartet-based Phylogenetic Tree Comparison

    … (CC) paradigm and give a polynomial time approximation scheme (PTAS) for a variation of the formulation called fractional character compatibility (FCC), which has been proven to be NP-hard. We also present a very simple algorithm called the Ordinal Split Method (OSM) to generate …

    waterloo Repository record for An Approximation Algorithm for Character Compatibility and Fast Quartet-based Phylogenetic Tree Comparison (opens in a new tab)

  9. The Adaptive Cross Approximation Algorithm Applied to Electromagnetic Scattering by Bodies of Revolution

    … of computational resources. The adaptive cross approximation (ACA) algorithm is a method which can be used to efficiently compute and store these matricies. This thesis will apply the ACA to a special class of problems known as scattering by bodies of revolution. A brief introduction to …

    duquesne Repository record for The Adaptive Cross Approximation Algorithm Applied to Electromagnetic Scattering by Bodies of Revolution (opens in a new tab)

  10. An Approximation Algorithm for the Stable Marriagae Problem with Ties and Incomplete Lists

    … of the famous Gale-Shapley stable matching algorithm that breaks ties using edge weights obtained by solving a linear programming relaxation of the problem, leading to an approximation ratio of 25/17 (approximately 1.47058). We apply ideas from factor-revealing LPs to show that this analysis …

    clemson Repository record for An Approximation Algorithm for the Stable Marriagae Problem with Ties and Incomplete Lists (opens in a new tab)

  11. A novel approximation algorithm for the solution and control of nonlinear and coupled systems

    This thesis develops and assesses the “approximation via dual auxiliary problems” (ADAP) method, a novel algorithm for solving nonlinear, coupled dynamical systems.Many existing approximation techniques use simplified initial guesses that are augmented through the use of calibrated corrections – …

    strathclyde Repository record for A novel approximation algorithm for the solution and control of nonlinear and coupled systems (opens in a new tab)

  12. An object-oriented framework for solving model problems using the sequential function approximation algorithm

    … in Fortran 90, for the Sequential Function Approximation (SFA) algorithm. The SFA algorithm is a meshless method which places its basis functions in the domain sequentially, using optimization techniques. The framework described herein allows the user to define the domain, boundary …

    rice Repository record for An object-oriented framework for solving model problems using the sequential function approximation algorithm (opens in a new tab)

  13. Iterative methods for estimation of 2-D AR parameters using a data-adaptive Toeplitz approximation algorithm

    A new two-dimensional data-adaptive algorithm utilizing the iterative Toeplitz approximation method is presented. This algorithm provides a robust and efficient means for accurate estimation of 2-D autoregressive parameters representing spatially variant data arrays. Its convergence performance is …

    nps Repository record for Iterative methods for estimation of 2-D AR parameters using a data-adaptive Toeplitz approximation algorithm (opens in a new tab)

  14. Stochastic Approximation for Identification of Multivariable Systems

    … thesis a non-parametric normalized stochastic approximation algorithm has been developed for the identification of multivariable systems from noisy data without prior knowledge of the statistics of measurement noise.</p> <p> The system model is first transformed into a special canonical form, …

    mcmaster Repository record for Stochastic Approximation for Identification of Multivariable Systems (opens in a new tab)

  15. Decomposition-based methods for Connectivity Augmentation Problems

    In this thesis, we study approximation algorithms for Connectivity Augmentation and related problems. In the Connectivity Augmentation problem, one is given a base graph G=(V,E) that is k-edge-connected, and an additional set of edges $L \subseteq V\times V$ that we refer to as links. The task is …

    waterloo Repository record for Decomposition-based methods for Connectivity Augmentation Problems (opens in a new tab)

Page 1 of 25