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 368 for “"Greedy Algorithm"”.

  1. Group Testing with Greedy Algorithm

    Group testing is all about identifying properties of a set of elements by testing them.

    unt Repository record for Group Testing with Greedy Algorithm (opens in a new tab)

  2. A greedy algorithm enhancing cage search

    … information about cubic cages is surveyed. A greedy algorithm that permits extremely sparse descriptions of known cages is presented. A number of methods for enhancing the algorithm performance is given. Also, a strategy for looking for better bounds on as yet unknown cages is presented.</p>

    iastate Repository record for A greedy algorithm enhancing cage search (opens in a new tab)

  3. Rescaled Pure Greedy Algorithm for Convex Optimization

    In this thesis, we suggest a new algorithm for solving convex optimization problems in Banach spaces. This algorithm is based on a greedy strategy, and it could be viewed as a nonlinear conjugate gradient type method. We prove its convergent rates under a suitable behavior of the modulus of uniform …

    tamu Repository record for Rescaled Pure Greedy Algorithm for Convex Optimization (opens in a new tab)

  4. Greedy Algorithm and M-Term Trigonometric Approximation: A Survey

    … of the paper [3] on the effectiveness of a Greedy Algorithm for best m-term trigonometric approximations for those unfamiliar with the subject and its methods. In particular, we will provide careful proofs of the three main theorems in that paper, providing details to the reader which are …

    south-carolina Repository record for Greedy Algorithm and M-Term Trigonometric Approximation: A Survey (opens in a new tab)

  5. A modified greedy algorithm for the task assignment problem.

    … heuristic to solve this problem by combining the Greedy Algorithm with the Meta-RaPS method. The Greedy Algorithm is a near-sighted assignment procedure that chooses the best assignment at each step until a full solution is found. Although the Greedy Algorithm finds a good solution for small to …

    louisville Repository record for A modified greedy algorithm for the task assignment problem. (opens in a new tab)

  6. Using greedy algorithm to learn graphical model for digit recognition

    … graphical model based on observed data through a greedy forward-backward algorithm and with the use of learned model to classify the data into different categories. We establish the graphical model associated with a binary Ising Markov random field. And model selection is implemented by adding and …

    texas Repository record for Using greedy algorithm to learn graphical model for digit recognition (opens in a new tab)

  7. From Pixels to Strings: Efficient String Art Creation Leveraging Greedy Algorithm

    … optimizes String Art generation using advanced algorithms. String art is a technique that creates visual artworks composed of straight lines of strings tensioned between pins distributed on a canvas. Initially employing the Hough Transform, issues such as computational complexity and edge …

    mississippi Repository record for From Pixels to Strings: Efficient String Art Creation Leveraging Greedy Algorithm (opens in a new tab)

  8. A greedy algorithm for learning pilot ratings from helicopter shipboard dynamic interface tests

    In a real world pattern recognition application a user cannot assess the performance of a classifier on an unlabeled data set. Classifiers cannot give their best performance because they require user-controlled parameters. As a Solution, a Sequential Function Approximation (SFA) method has been' …

    rice Repository record for A greedy algorithm for learning pilot ratings from helicopter shipboard dynamic interface tests (opens in a new tab)

  9. Relaxations of the optimality requirement on the thresholding greedy algorithm for bases of Banach spaces

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2023-09-01 without embargo terms

    uiuc Repository record for Relaxations of the optimality requirement on the thresholding greedy algorithm for bases of Banach spaces (opens in a new tab)

  10. Automation of greedy algorithm for segmentation with minimized exception : binary for EEG burst detection homogenous string segmentation

    … to investigate, various homogeneous criteria and algorithms used for string segmentation. An efficient implementation of greedy algorithm for SME – Binary (segmentation with minimized exception) is carried out for EEG signal burst detection. The result of greedy algorithm is analyzed in the …

    chalmers Repository record for Automation of greedy algorithm for segmentation with minimized exception : binary for EEG burst detection homogenous string segmentation (opens in a new tab)

  11. Super Greedy Type Algorithms and Applications In Compressed Sensing

    In this manuscript we study greedy-type algorithms such that at a greedy step we pick several dictionary elements contrary to a single dictionary element in standard greedy-type algorithms. We call such greedy algorithms super greedy type algorithms. In the general setting, we propose several new …

    south-carolina Repository record for Super Greedy Type Algorithms and Applications In Compressed Sensing (opens in a new tab)

  12. Convergence and Rate of Convergence of Approximate Greedy-Type Algorithms

    … of convergence and rate of convergence of greedy-type algorithms under imprecise step evaluations. Such algorithms are in demand as the issue of calculation errors appears naturally in applications. We address the question of strong convergence of the Chebyshev Greedy Algorithm (CGA), which …

    south-carolina Repository record for Convergence and Rate of Convergence of Approximate Greedy-Type Algorithms (opens in a new tab)

  13. Investigation of effect of different run-time distributions on SmartNet performance

    … using the Opportunistic Load Balancing (OLB) Algorithm, the Limited Best Assignment (LBA) Algorithm, an O(mn squared) Greedy Algorithm, and an O(mn) Greedy Algorithm. SmartNet is a framework for scheduling jobs and machines in a heterogeneous computing environment. Its major strength is its …

    nps Repository record for Investigation of effect of different run-time distributions on SmartNet performance (opens in a new tab)

  14. Automating the manual process of scheduling jobs in prepared plans for a pharmaceutical company

    … the jobs to a prepared plan, optimization, a greedy algorithm and the current manual assignment in use today at the pharmaceutical company. The comparison was based on real data from the pharmaceutical company. The goal is to see if the process can be automated. Results show that both …

    reykjavik Repository record for Automating the manual process of scheduling jobs in prepared plans for a pharmaceutical company (opens in a new tab)

  15. Finding the Densest Common Subgraph with Linear Programming

    … simplex method. The DCS LP is also compared to a greedy algorithm and a Lagrangian relaxation of DCS LP.We conclude that the greedy algorithm is a good heuristic while the LP is well suited to problems where a closer approximation is important.

    chalmers Repository record for Finding the Densest Common Subgraph with Linear Programming (opens in a new tab)

  16. Greedy structure learning of Markov Random Fields

    … we introduce an adaptive forward-backward greedy algorithm for learning the structure of a discrete, pairwise MRF given a high dimensional set of i.i.d. samples. The algorithm works by greedily estimating the neighborhood of each node independently through a series of forward and backward …

    texas Repository record for Greedy structure learning of Markov Random Fields (opens in a new tab)

  17. Yield improvement of chemical mechanical planarization processes

    … on this research is the development of control algorithm for CMP process. Wafer-scale and die-scale models are the two scales used in this study. To achieve improvement in wafer yield, three control strategies are formulated with greedy algorithm, method heuristic and non-linear programming in …

    iastate Repository record for Yield improvement of chemical mechanical planarization processes (opens in a new tab)

  18. An Algorithm for Influence Maximization and Target Set Selection for the Deterministic Linear Threshold Model

    … from these influential nodes. Inputs to our algorithm include edge weights and vertex thresholds. The threshold difference greedy algorithm presented in this thesis takes into account both the edge weights as well as vertex thresholds in computing influence of a node. The threshold difference …

    vt Repository record for An Algorithm for Influence Maximization and Target Set Selection for the Deterministic Linear Threshold Model (opens in a new tab)

  19. Algorithms for Scheduling Teaching Assistants - A comparison focused on preference satisfaction, workload fairness, and computational performance

    … and hard constraints for the scheduling algorithms. This thesis investigates four algorithms: a simple greedy algorithm; a simple genetic algorithm; Tabu Search; and Simulated Annealing. Results reveal that although Greedy Algorithm was the quickest, it performed poorly on constraint …

    chalmers Repository record for Algorithms for Scheduling Teaching Assistants - A comparison focused on preference satisfaction, workload fairness, and computational performance (opens in a new tab)

  20. Targeted Influence Maximization In Labeled Social Networks with Non-Target Constraints

    … within the threshold theta. We propose two algorithms based on the greedy approach and establish certain approximation guarantees. We extend this greedy algorithm to a Multi-Greedy algorithm. However, the pure greedy methods are not practically viable due to prohibitively high time overhead. …

    iastate Repository record for Targeted Influence Maximization In Labeled Social Networks with Non-Target Constraints (opens in a new tab)

Page 1 of 19