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 1564 for “"Greedy"”.
-
Generalizing Contexts Amenable to Greedy and Greedy-like Algorithms
… One particularly interesting paradigm is the greedy algorithm paradigm. Informally, a greedy algorithm builds a solution to a problem incrementally by making locally optimal decisions at each step. Greedy algorithms are important in algorithm design as they are natural, conceptually simple to …
-
Greedy quasigroups and greedy algebras with applications to combinatorial games
<p>Greedy quasigroups and Wythoff Quasigroups arose out of a desire to better understand certain combinatorial games. Greedy and Wythoff quasigroups have remarkable algebraic properties. In particular, I will investigate the existence of subquasigroups and isomorphism classes. Natural …
-
Max-Min Greedy Matching
We study the problem of max-min greedy matching introduced in (Eden et al. 2022). The max-min greedy matching problem is a variant of the well known online bipartite matching problem introduced in (Karp et al. 1990). Given a bipartite graph $G=(U \cup V; E)$, the first player selects a priority …
-
On path-greedy geometric spanners
… algorithm used to generate spanners is path-greedy, which scans pairs of points in non-decreasing order of distance and adds the edge between them unless the current set of added edges already connects them with a path that t-approximates the edge length. Graphs from this algorithm are called …
-
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.
-
Group Testing with Greedy Algorithm
Group testing is all about identifying properties of a set of elements by testing them.
-
Greedy Strategies for Convex Minimization
We have investigated two greedy strategies for finding an approximation to the minimum of a convex function E, defined on a Hilbert space H. We have proved convergence rates for a modification of the orthogonal matching pursuit and its weak version under suitable conditions on the objective …
-
Greedy quasigroups and combinatorial games
<p>Greedy quasigroups arose out of a desire to better understand certain combinatorial games. In this paper, I will discuss some basis combinatorial game theory to provide motivation and quasigroup theory as background information. Greedy quasigroups have remarkable algebraic properties. In …
-
Greedy Hunger and Happy Ruin
Greedy Hunger and Happy Ruin is a collection of poems that gathers a life of fragments and frayed ends into a loose narrative of desire, loss, language, and almost redemption. The poems examine the costs of leaving home, as seen in a mermaid's wish to become human, an immigrant family's aspirations …
-
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>
-
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 …
-
Deterministic Greedy Algorithms for Optimal Sensor Placement
… any typical network, it has been proven that a greedy placement algorithm achieves a minimum of 63% optimal reduction in total variance. The focus in this paper is on sensor-optimization problem with the help of two approximation algorithms inherited from traditional greedy approach with …
-
Greedy Representative Selection for Unsupervised Data Analysis
… of time and memory-efficient algorithms for greedy column subset selection. Experiments on real data sets demonstrate the effectiveness and efficiency of the proposed algorithms in comparison to the state-of-the-art methods for column subset selection. Second, a kernel-based algorithm is …
-
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 …
-
Rescaled Pure Greedy Algorithm for Convex Optimization
… 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 smoothness of the objective function. We apply the proposed algorithm on several …
-
Graph embeddings for low-stretch greedy routing
The simplest greedy geometric routing forwards packets to make most progress in terms of geometric distance within reach. Its notable advantages are low complexity, and the use of local information only. However, two problems of greedy routing are that delivery is not always guaranteed, and that …
-
Greedy Feature Selection in Tree Kernel Spaces
… context of Support Vector learning, based on a greedy exploration of the fragment space. Features are selected according to a gradient norm preservation criterion, i.e. we select the heaviest features that account for a large percentage of the gradient norm, and are explicitly modeled and …
-
A Parallel Implementation of A Greedy TSP Algorithm
The Traveling Salesman Problem has often been used as an exploration ground for building heuristics to calculate the shortest path of a complete graph that traverse every vertex exactly once. This has a number of important practical applications. Since it is an NP-hard problem, many heuristics have …
Page 1 of 79