Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Greedy algorithm for Egyptian fractions (view)

searching for Greedy algorithm 54 found (302 total)

DIALIGN-TX (193 words) [view diff] exact match in snippet view article find links to article

a substantial improvement of DIALIGN-T that combines the previous greedy algorithm with a progressive alignment approach. DIALIGN-T Sequence alignment

Power graph analysis (1,580 words) [view diff] exact match in snippet view article find links to article

unique minimal power graph of minimal nesting level. The power graph greedy algorithm relies on two simple steps to perform the decomposition: The first

Las Vegas algorithm (2,523 words) [view diff] no match in snippet view article find links to article

In computing, a Las Vegas algorithm is a randomized algorithm that always gives correct results; that is, it always produces the correct result or it informs

167 (number) (317 words) [view diff] exact match in snippet view article

smallest number which requires six terms when expressed using the greedy algorithm as a sum of squares, 167 = 144 + 16 + 4 + 1 + 1 + 1, although by Lagrange's

Multi-fragment algorithm (131 words) [view diff] exact match in snippet view article find links to article

(and related problems). This algorithm is also sometimes called the "greedy algorithm" for the TSP. The algorithm builds a tour for the traveling salesman

Graph Aligner (1,039 words) [view diff] exact match in snippet view article find links to article

alignment radially outward around the seed as far as practical using a greedy algorithm (see [Kuchaiev et al., 2010] for details). When aligning two graphs

Network flow problem (440 words) [view diff] exact match in snippet view article find links to article

polynomial algorithm for maximum flow The Ford–Fulkerson algorithm, a greedy algorithm for maximum flow that is not in general strongly polynomial The network

Perfectly orderable graph (1,149 words) [view diff] exact match in snippet view article find links to article

the graphs for which there is an ordering that is optimal for the greedy algorithm not just for the graph itself, but for all of its induced subgraphs

Nearest neighbour algorithm (466 words) [view diff] exact match in snippet view article find links to article

Mathematics 117 (2002), 81–86. J. Bang-Jensen, G. Gutin and A. Yeo, When the greedy algorithm fails. Discrete Optimization 1 (2004), 121–127. G. Bendall and F. Margot

Grammar-based code (589 words) [view diff] exact match in snippet view article find links to article

then the produced CFG is encoded by an arithmetic coder. Re-Pair is a greedy algorithm using the strategy of most-frequent-first substitution. The compressive

Scaffolding (bioinformatics) (1,368 words) [view diff] exact match in snippet view article

greedy, non greedy, conservative, or non conservative. Bambus uses a greedy algorithm, defined as such because it joins together contigs with the most links

F2FS (2,039 words) [view diff] exact match in snippet view article find links to article

address the log block thrashing problem present in the greedy algorithm. F2FS uses the greedy algorithm for on-demand cleaning, the background cleaner uses

Phrap (878 words) [view diff] exact match in snippet view article find links to article

assembly building internally and later rounds are less stringent - Greedy algorithm. These design choices were helpful in the 1990s when the program was

John C. Gittins (331 words) [view diff] case mismatch in snippet view article find links to article

177–187 ) (2001) (with G. Harper) "Bounds on the Performance of a Greedy Algorithm for Probabilities". Mathematics of Operations Research, 26, 313–323

Dominating set (4,082 words) [view diff] exact match in snippet view article find links to article

using a simple greedy algorithm, and finding a sublogarithmic approximation factor is NP-hard. More specifically, the greedy algorithm provides a factor

Jack Edmonds (1,543 words) [view diff] exact match in snippet view article find links to article

Paths, trees, and flowers]). Edmonds, Jack (1971). "Matroids and the greedy algorithm". Math. Programming (Princeton Symposium Math. Prog. 1967). 1: 127–136

John Langford (computer scientist) (289 words) [view diff] case mismatch in snippet view article

2012. Langford, John; Zhang, Tong (December 3, 2007). "The Epoch-Greedy Algorithm for ContextualMulti-armed Bandits" (PDF). Li, Lihong; Chu, Wei; Langford

Interval chromatic number of an ordered graph (179 words) [view diff] exact match in snippet view article find links to article

chromatic number that it is easily computable. Indeed, by a simple greedy algorithm one can efficiently find an optimal partition of the vertex set of

Webist (1,815 words) [view diff] case mismatch in snippet view article find links to article

Kotkov, Jari Veijalainen and Shuaiqiang Wang. "A Serendipity-Oriented Greedy Algorithm for Recommendations" Best Student Paper - Claire Prudhomme, Timo Homburg

Annalisa Buffa (838 words) [view diff] exact match in snippet view article find links to article

Christophe; Turinici, Gabriel (2012). "A prioriconvergence of the Greedy algorithm for the parametrized reduced basis method". Esaim: Mathematical Modelling

Multiway number partitioning (4,749 words) [view diff] exact match in snippet view article find links to article

general. However, in the average case it performs much better than the greedy algorithm: for k =2, when numbers are distributed uniformly in [0,1], its approximation

DSatur (769 words) [view diff] exact match in snippet view article find links to article

2021, DSatur produced significantly better vertex colourings than the greedy algorithm on random graphs with edge probability p = 0.5 {\displaystyle p=0.5}

Heterogeneous earliest finish time (729 words) [view diff] exact match in snippet view article find links to article

easily fail to find the optimal scheduling. HEFT is essentially a greedy algorithm and incapable of making short-term sacrifices for long term benefits

Participatory budgeting experiments (1,788 words) [view diff] exact match in snippet view article find links to article

it affect the final outcome? They particularly compared the simple greedy algorithm (which assumes cost-based satisfaction) with equal shares (assuming

Vertex cover (2,556 words) [view diff] exact match in snippet view article find links to article

from the graph. Put otherwise, we find a maximal matching M with a greedy algorithm and construct a vertex cover C that consists of all endpoints of the

Recursive largest first algorithm (842 words) [view diff] exact match in snippet view article find links to article

heuristics such as the O ( n + m ) {\displaystyle {\mathcal {O}}(n+m)} greedy algorithm and the O ( ( n + m ) lg ⁡ n ) {\displaystyle {\mathcal {O}}((n+m)\lg

V-optimal histograms (1,677 words) [view diff] exact match in snippet view article find links to article

V-optimal Histograms. Iterative Improvement (II) is a fairly naïve greedy algorithm. Starting from a random state, iterative steps in many directions are

Assignment problem (2,960 words) [view diff] exact match in snippet view article find links to article

Alice: Task 1 = 1, Task 2 = 2. George: Task 1 = 5, Task 2 = 8. The greedy algorithm would assign Task 1 to Alice and Task 2 to George, for a total cost

Swiss-system tournament (3,688 words) [view diff] case mismatch in snippet view article find links to article

Machine Schmand, Daniel; Schröder, Marc; Vargas Koch, Laura (2020). "A Greedy Algorithm for the Social Golfer and the Oberwolfach Problem". arXiv:2007.10704

Earth mover's distance (2,191 words) [view diff] exact match in snippet view article find links to article

linear program. This generalized EMD may be computed exactly using a greedy algorithm, and the resulting functional has been shown to be Minkowski additive

Grundy number (1,355 words) [view diff] exact match in snippet view article find links to article

greedy coloring (left) and Grundy coloring (right) of a crown graph. The numbers indicate the order in which the greedy algorithm colors the vertices.

Sidon sequence (2,208 words) [view diff] exact match in snippet view article find links to article

sequences. For the other direction, Chowla and Mian observed that the greedy algorithm gives an infinite Sidon sequence with A ( x ) > c x 3 {\displaystyle

Envy minimization (1,233 words) [view diff] exact match in snippet view article find links to article

case.: 3 With additive and identical valuations:: 4–6 The following greedy algorithm finds an allocation whose maximum envy-ratio is at most 1.4 times the

Point location (2,171 words) [view diff] exact match in snippet view article find links to article

the subdivision. Because the subdivision is formed by triangles, a greedy algorithm can find an independent set that contains a constant fraction of the

Delta-matroid (518 words) [view diff] exact match in snippet view article find links to article

"Delta-matroids: Origins", The Matroid Union Bouchet, André (1987), "Greedy algorithm and symmetric matroids", Mathematical Programming, 38 (2): 147–159

Single-machine scheduling (2,762 words) [view diff] exact match in snippet view article find links to article

special case of a cost function). The maximum cost can be minimized by a greedy algorithm known as Lawler's algorithm.: lecture 2, part 1 The problem 1| r j

Alan J. Hoffman (3,693 words) [view diff] exact match in snippet view article find links to article

0-1 matrices for which the dual linear program can be solved by the greedy algorithm for all right-hand sides and all objective functions with decreasing

Steinhaus–Johnson–Trotter algorithm (2,860 words) [view diff] exact match in snippet view article find links to article

described equivalently as the ordering generated by the following greedy algorithm. Start with the identity permutation 1 2 … n {\displaystyle 1\;2\;\ldots

Entity linking (3,664 words) [view diff] exact match in snippet view article find links to article

approach is AIDA, which uses a series of complex graph algorithms and a greedy algorithm that identifies coherent mentions on a dense subgraph by also considering

Robert Haralick (2,324 words) [view diff] case mismatch in snippet view article find links to article

Journal of Digital Imaging, 1997, August;10(3 Suppl 1), pages 212-217. Greedy Algorithm for Error Correction in Automatically Produced Boundaries from Low

Salem–Spencer set (2,612 words) [view diff] exact match in snippet view article find links to article

Foundation Erdős, P.; Lev, V.; Rauzy, G.; Sándor, C.; Sárközy, A. (1999), "Greedy algorithm, arithmetic progressions, subset sums and divisibility", Discrete Mathematics

Expander code (2,562 words) [view diff] exact match in snippet view article find links to article

N(v){\text{ and }}N(v)\cap V(y){\text{ is odd}}\}|\,} . Then consider the greedy algorithm: Input: received word y {\displaystyle y\,} . initialize y' to y while

Largest differencing method (2,220 words) [view diff] case mismatch in snippet view article find links to article

these tuples. For k=2, CKK runs substantially faster than the Complete Greedy Algorithm (CGA) on random instances. This is due to two reasons: when an equal

Hungarian algorithm (5,587 words) [view diff] exact match in snippet view article find links to article

This also leads to at least one zero in each row. As such, a naive greedy algorithm can attempt to assign all workers a task with a penalty of zero. This

Edge coloring (8,472 words) [view diff] exact match in snippet view article find links to article

ISBN 9780898716986. Bar-Noy, Amotz; Motwani, Rajeev; Naor, Joseph (1992), "The greedy algorithm is optimal for on-line edge coloring", Information Processing Letters

Fair division among groups (3,170 words) [view diff] exact match in snippet view article find links to article

⁡ n ) {\displaystyle \Omega (n\log n)} , and can be attained by a greedy algorithm that maximizes the sum of utilities. The results can be extended to

Arrow–Debreu model (9,223 words) [view diff] exact match in snippet view article find links to article

\langle p,x^{i}\rangle } as its budget. This is trivial. Here is a greedy algorithm to do it: first distribute all endowment of commodity 1 to household

Syntactic parsing (computational linguistics) (2,829 words) [view diff] exact match in snippet view article

morphological information, etc. This is an O ( n ) {\displaystyle O(n)} greedy algorithm, so it does not guarantee the best possible parse or even a necessarily

Arrangement of lines (6,722 words) [view diff] exact match in snippet view article find links to article

30–34, doi:10.2307/2687957, JSTOR 2687957 Cuntz, Michael (2022), "A greedy algorithm to compute arrangements of lines in the projective plane", Discrete

Lattice of stable matchings (3,930 words) [view diff] exact match in snippet view article find links to article

Then one can find the minimum-regret stable matching by a simple greedy algorithm that starts at the bottom element of the lattice of matchings and then

Stein discrepancy (4,615 words) [view diff] exact match in snippet view article find links to article

m}{m}}}\right).} Non-myopic and mini-batch generalisations of the greedy algorithm have been demonstrated to yield further improvement in approximation

Convolutional sparse coding (6,082 words) [view diff] exact match in snippet view article find links to article

orthogonal matching pursuit (OMP) and basis pursuit (BP). OMP is a greedy algorithm that iteratively selects the atom best correlated with the residual

Multi-issue voting (6,376 words) [view diff] exact match in snippet view article find links to article

G-PJR allocation always exists (using a super-polynomial time cohesive-greedy algorithm), and it is fixed-parameter tractable w.r.t. the number of voters.

List of RNA-Seq bioinformatics tools (20,393 words) [view diff] exact match in snippet view article find links to article

sequencing error corrector designed for Illumina short reads. It uses a non-greedy algorithm with a speed comparable to implementations based on greedy methods