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 96 for “"greedy algorithm"”.
-
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 …
-
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
-
Super Greedy Type Algorithms and Applications In Compressed Sensing
<p>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 …
-
Load Balancing in NetApp’s Clustered Storage Systems
… this thesis aims to design and implement an algorithm that results in more evenly distributed cluster reconfigurations with minimal disturbance to clients’ workloads. I implement three different greedy algorithms to find a more balanced workload-node assignment that lowers the maximum number …
-
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 …
-
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 …
-
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 …
-
Static-task scheduling incorporating precedence constraints and deadlines in a heterogeneous-computing environment / Michael D Niedert
… Nonetheless, the choice of a heuristic algorithm greatly affects the speed of solution. This work evaluates a greedy algorithm, an A* algorithm, and a simulated annealing algorithm applied to the heterogeneous scheduling problem with deadline and dependency constraints. Tradeoffs of …
-
A constructive lower bound for cardinality of codebooks capable of correcting multiple deletion and insertions
… number of deletions and insertions. We propose a greedy algorithm which can find a maximal solution in polynomial time in the number of vertices of the graph. Results are presented for block codes of length n and the lower bounds are proved from analyzing the greedy algorithm on these graphs. A …
-
Greedy Algorithms In Approximation Theory and Compressed Sensing
… consideration is how to construct good methods (algorithms) of approximation, and how to measure the performance of these methods. One of the most successful approaches in this area is the greedy method, which belongs to the theory of nonlinear approximation. This dissertation answers the …
-
Greedy Algorithms and Incoherent Systems
… best upper bound on the rate of convergence of greedy expansions, and explicit formulas for approximants from the Pure Greedy Algorithm.</p>
-
Additive Lebesgue-Type Inequalities for Greedy Approximation
… and focus on a class of such techniques called "greedy algorithms". A problem that we will be mostly concerned with is of measuring performance of these algorithms (specifically, Pure Greedy Algorithm and Orthogonal Greedy Algorithm). We will compare several ways to describe the quality of the …
-
On subset-sum-distinct sequences of positive integers
… of such a sequence is at most two, and that the greedy algorithm generates the unique extremal sequence. Here his result is obtained by elementary ""Karamata-type"" inequalities that are shown to have a wide range of applicability to many related problems. Included is an elementary proof of the …
-
Greedy Inference Algorithms for Structured and Neural Models
… optimal solution extremely expensive. Thus, greedy algorithms, making trade-offs between precision and efficiency, are widely used. Unfortunately, they in general lack theoretical guarantees. In this thesis, we prove that greedy algorithms are effective and efficient to search for multiple …
-
Some Extremal Problems in Additive Number Theory
… whose squares have sum n. Using a modified greedy algorithm, we give a precise asymptotic estimate for t(n) which shows, in particular, that t(n) is very closely approximated by n .
-
MAC layer resource allocation algorithms for OFDM/TDMA wireless networks
… Centralized and distributed resource location algorithms based on graph theory are introduced that assign both time-slots and channels to wireless transmission links in multihop networks. For finding the possible set of users that can transmit concurrently, a new conflict graph is investigated. …
-
In pursuit of high resolution radar using pursuit algorithms
… solution. In this thesis, we focus on the greedy algorithm approach to solve the problem and show that it naturally yields a quantitative measure for radar resolution. In addition, we show that the limitations of the greedy algorithms can be attributed to the close relation between greedy …
-
Conformance preserving data dissemination for large-scale peer to peer systems
… Filter (MCF) overlay. We describe an online greedy algorithm to compute the minimum-size data sequence for dissemination and prove that it gives the optimal approximation ratio to the optimal off-line solution for all deterministic online algorithms. We then show that our multilevel …
-
Parsimonious, Risk-Aware, and Resilient Multi-Robot Coordination
… as submodular optimization is that a simple, greedy algorithm is guaranteed to give a good performance. However, often this comes at the expense of unrealistic models and assumptions. For example, the standard formulation does not take into account the fact that robots may fail, either …
-
Design analytics for product family optimization
… which has constant cost can be solved with the greedy algorithm, the modified greedy algorithm for product family design is proposed in this work. The methods are tested to maximize shared components among product family designs in automotive vehicle design. The last work of the thesis includes …
Page 1 of 5