Find link

language:

Find link is a tool written by Edward Betts.

searching for SIMPLE algorithm 170 found (179 total)

Golomb coding (2,607 words) [view diff] case mismatch in snippet view article find links to article

backwards-adaptive encoder. The RLGR encoder [1] achieves that using a very simple algorithm that adjusts the Golomb–Rice parameter up or down, depending on the

Winnow (algorithm) (629 words) [view diff] case mismatch in snippet view article

when many dimensions are irrelevant (hence its name winnow). It is a simple algorithm that scales well to high-dimensional data. During training, Winnow

Bubble sort (2,318 words) [view diff] case mismatch in snippet view article find links to article

the way the larger elements "bubble" up to the top of the list. This simple algorithm performs poorly in real world use and is used primarily as an educational

Cristian's algorithm (345 words) [view diff] case mismatch in snippet view article find links to article

primarily used in low-latency intranets. Cristian observed that this simple algorithm is probabilistic, in that it only achieves synchronization if the round-trip

Search by sound (395 words) [view diff] case mismatch in snippet view article find links to article

Axwave, ACRCloud and others have seen considerable success by using a simple algorithm to match an acoustic fingerprint to a song in a library. These applications

Subdivision surface (1,373 words) [view diff] case mismatch in snippet view article find links to article

approximate the final underlying curved surface. Less commonly, a simple algorithm is used to add geometry to a mesh by subdividing the faces into smaller

K-edge-connected graph (937 words) [view diff] case mismatch in snippet view article find links to article

determine the largest k for which a graph G is k-edge-connected. A simple algorithm would, for every pair (u,v), determine the maximum flow from u to v

Multi-trials technique (218 words) [view diff] case mismatch in snippet view article find links to article

employing more attempts with every message exchange. For example, in a simple algorithm for computing an O(Δ) vertex coloring, where Δ denotes the maximum

Neural gas (1,808 words) [view diff] case mismatch in snippet view article find links to article

in 1991 by Thomas Martinetz and Klaus Schulten. The neural gas is a simple algorithm for finding optimal data representations based on feature vectors.

David H. Bailey (mathematician) (833 words) [view diff] case mismatch in snippet view article

hexadecimal digits of pi beginning at an arbitrary position, by means of a simple algorithm. Subsequently, Bailey and Richard Crandall showed that the existence

Power iteration (2,497 words) [view diff] case mismatch in snippet view article find links to article

is also known as the Von Mises iteration. Power iteration is a very simple algorithm, but it may converge slowly. The most time-consuming operation of the

El Ajedrecista (1,016 words) [view diff] case mismatch in snippet view article find links to article

within the 50 moves allotted by the fifty-move rule, because of the simple algorithm that calculates the moves. It did, however, checkmate the opponent

Truncated binary encoding (855 words) [view diff] no match in snippet view article find links to article

Truncated binary encoding is an entropy encoding typically used for uniform probability distributions with a finite alphabet. It is parameterized by an

Wait-for graph (448 words) [view diff] case mismatch in snippet view article find links to article

conjunctive case, and by knots in the disjunctive case. There is no simple algorithm for detecting the possibility of deadlock in the final case. A wait-for

Projections onto convex sets (1,118 words) [view diff] case mismatch in snippet view article find links to article

point in the intersection of two closed convex sets. It is a very simple algorithm and has been rediscovered many times. The simplest case, when the sets

Fitness proportionate selection (1,020 words) [view diff] case mismatch in snippet view article find links to article

individuals in O(1) time will be to use the alias method. In 2011, a very simple algorithm was introduced that is based on "stochastic acceptance". The algorithm

Luby transform code (1,582 words) [view diff] case mismatch in snippet view article find links to article

distinguishing characteristic of LT codes is in employing a particularly simple algorithm based on the exclusive or operation ( ⊕ {\displaystyle \oplus } ) to

Karloff–Zwick algorithm (368 words) [view diff] case mismatch in snippet view article find links to article

irrespective of whether the original formula is satisfiable. Further, this simple algorithm can also be easily derandomized using the method of conditional expectations

Reservoir sampling (3,532 words) [view diff] no match in snippet view article find links to article

Reservoir sampling is a family of randomized algorithms for choosing a simple random sample, without replacement, of k items from a population of unknown

Mediant (mathematics) (2,037 words) [view diff] case mismatch in snippet view article

obtained purely by iterative computation of the mediant according to a simple algorithm. The mediant inequality: An important property (also explaining its

Computational hardness assumption (3,227 words) [view diff] case mismatch in snippet view article find links to article

hardness assumptions are also useful for guiding algorithm designers: a simple algorithm is unlikely to refute a well-studied computational hardness assumption

Auction algorithm (798 words) [view diff] case mismatch in snippet view article find links to article

shortest path problems was introduced by Bertsekas in 1991. It is a simple algorithm for finding shortest paths in a directed graph. In the single origin/single

Motion detection (550 words) [view diff] case mismatch in snippet view article find links to article

entered/vacated Activating a camera to record new events (e.g. human activity) A simple algorithm for motion detection by a fixed camera compares the current image with

Knot group (389 words) [view diff] case mismatch in snippet view article find links to article

general) can be computed in the Wirtinger presentation by a relatively simple algorithm. The unknot has knot group isomorphic to Z. The trefoil knot has knot

Pigpen cipher (1,226 words) [view diff] case mismatch in snippet view article find links to article

Hudson, p. 269 Parrangan, Dwijayanto G., and Theofilus Parrangan. "New Simple Algorithm for Detecting the Meaning of Pigpen Chiper Boy Scout (“Pramuka”)." International

Routing table (1,118 words) [view diff] case mismatch in snippet view article find links to article

the next hop. Assuming that the routing tables are consistent, the simple algorithm of relaying packets to their destination's next hop thus suffices to

Random permutation (735 words) [view diff] case mismatch in snippet view article find links to article

1 and sets xi equal to the jth largest of the unchosen numbers. A simple algorithm to generate a permutation of n items uniformly at random without retries

Random encounter (1,172 words) [view diff] case mismatch in snippet view article find links to article

to the player's perception of getting "bogged down", but with the simple algorithm, it is possible to have an encounter from taking only one step after

Cutaway drawing (646 words) [view diff] case mismatch in snippet view article find links to article

according to Diepstraten et al. (2003), "can seldom be formalized in a simple algorithm, But the properties of cutaway can be distinguish in two classes of

JPEG XT (1,434 words) [view diff] case mismatch in snippet view article find links to article

based on the XDepth format from Trellis Management. Profile D uses a simple algorithm which does not generate an enhancement image – the enhancement layer

NL (complexity) (1,290 words) [view diff] case mismatch in snippet view article

is contained in but not known or believed to equal NL. There is a simple algorithm that establishes that C = NL. Clearly C is contained in NL, since:

Voronoi diagram (5,590 words) [view diff] case mismatch in snippet view article find links to article

a description of the algorithm. Skyum, Sven (18 February 1991). "A simple algorithm for computing the smallest enclosing circle". Information Processing

CRM114 (program) (697 words) [view diff] case mismatch in snippet view article

demonstrating how machine learning can be accomplished with a reasonably simple algorithm. The program's C source code is available under the GPL. At a deeper

Combination puzzle (954 words) [view diff] no match in snippet view article find links to article

is much the same as 3×3×3 cube except additional (and relatively simple) algorithm(s) are required to unscramble the centre pieces and edges and additional

Round-robin tournament (3,318 words) [view diff] case mismatch in snippet view article find links to article

one competitor having no game in that round. The circle method is a simple algorithm to create a schedule for a round-robin tournament. All competitors

Audio mixing (recorded music) (3,102 words) [view diff] case mismatch in snippet view article

dedicated summing amplifier or, in the case of a digital mixer, by a simple algorithm. Routing of source signals to internal buses or external processing

Connectivity (graph theory) (2,062 words) [view diff] case mismatch in snippet view article

data structure), or to count the number of connected components. A simple algorithm might be written in pseudo-code as follows: Begin at any arbitrary

Mental calculation (7,302 words) [view diff] case mismatch in snippet view article find links to article

two numbers are equidistant from the nearest multiple of 100, then a simple algorithm can be used to find the product. As a simple example: 33 × 67 {\displaystyle

Ribbon diagram (1,074 words) [view diff] case mismatch in snippet view article find links to article

implementation that uses Protein Data Bank files as input. This conceptually simple algorithm fit cubic polynomial B-spline curves to the peptide planes. Most modern

Multi-armed bandit (7,050 words) [view diff] case mismatch in snippet view article find links to article

set of policies, and the algorithm is computationally inefficient. A simple algorithm with logarithmic regret is proposed in: UCB-ALP algorithm: The framework

Weighted matroid (1,652 words) [view diff] case mismatch in snippet view article find links to article

testing whether a set is independent. Jack Edmonds proved that this simple algorithm indeed finds an independent set with maximum weight. Denote the set

Exit (game show) (1,225 words) [view diff] case mismatch in snippet view article

Mineshaft (Sand Room) − This room is played with two teams remaining. A simple algorithm designates which team goes first in this room as they step into sand

Line wrap and word wrap (1,640 words) [view diff] case mismatch in snippet view article find links to article

rather than programmable digital computers, and therefore needed a simple algorithm that could be implemented without data buffers. In the Western Union

Mojibake (5,985 words) [view diff] case mismatch in snippet view article find links to article

US-ASCII. UTF-8 also has the ability to be directly recognised by a simple algorithm, so that well written software should be able to avoid mixing UTF-8

Cryptographically secure pseudorandom number generator (3,614 words) [view diff] case mismatch in snippet view article find links to article

quasi-random bit stream. Even earlier, John von Neumann proved that a simple algorithm can remove a considerable amount of the bias in any bit stream, which

Weak coloring (435 words) [view diff] case mismatch in snippet view article find links to article

graph has a weak 2-coloring. The figure on the right illustrates a simple algorithm for constructing a weak 2-coloring in an arbitrary graph. Part (a)

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

block itself. The last edge is found on the bottom layer, and a very simple algorithm is executed to get it in the right place, followed by keyhole last

Bélády's anomaly (346 words) [view diff] case mismatch in snippet view article find links to article

frames are in use, one must be cleared to make room for the new page. A simple algorithm is FIFO: whichever page has been in the frames the longest is the one

Eigenvalue algorithm (4,863 words) [view diff] case mismatch in snippet view article find links to article

expressed as the corresponding similarity matrices. While there is no simple algorithm to directly calculate eigenvalues for general matrices, there are numerous

Ping-pong scheme (496 words) [view diff] case mismatch in snippet view article find links to article

erroneously called "ping" and "pong". In routing, a Ping-Pong scheme is a simple algorithm for distributing data packets across two paths. If you had two paths

Cell lists (1,200 words) [view diff] case mismatch in snippet view article find links to article

1002/jcc.20071. PMID 15224391. S2CID 10464744. Gonnet, Pedro (2007). "A Simple Algorithm to Accelerate the Computation of Non-Bonded Interactions in Cell-Based

Triangle-free graph (2,487 words) [view diff] case mismatch in snippet view article find links to article

triangle-free. For dense graphs, it is more efficient to use this simple algorithm which again relies on matrix multiplication, since it gets the time

Longplayer (886 words) [view diff] case mismatch in snippet view article find links to article

minutes and 20 seconds in length, which is processed by computer using a simple algorithm. This gives a large number of variations, which, when played consecutively

Algorithm (7,354 words) [view diff] case mismatch in snippet view article find links to article

requires looking at every number in the list. From this follows a simple algorithm, which can be stated in a high-level description in English prose,

Kabsch algorithm (1,147 words) [view diff] case mismatch in snippet view article find links to article

available the optimal rotation, R, can be calculated using the following simple algorithm. First, calculate the SVD of the covariance matrix H, H = U Σ V T {\displaystyle

Eratosthenes (4,042 words) [view diff] case mismatch in snippet view article find links to article

knowing his love for learning and mathematics. Eratosthenes proposed a simple algorithm for finding prime numbers. This algorithm is known in mathematics as

Ore's theorem (1,040 words) [view diff] case mismatch in snippet view article find links to article

does not obey property (∗). Palmer (1997) describes the following simple algorithm for constructing a Hamiltonian cycle in a graph meeting Ore's condition

Fair coin (2,190 words) [view diff] case mismatch in snippet view article find links to article

{\displaystyle b:=P({\mathtt {H}})} is known. In this section, we provide a simple algorithm that improves the expected number of coin tosses. The algorithm utilizes

Markov chain mixing time (590 words) [view diff] case mismatch in snippet view article find links to article

1214/aoap/1177005705, JSTOR 2959752, MR 1161056. Jerrum, Mark (1995), "A very simple algorithm for estimating the number of k-colorings of a low-degree graph", Random

MAX-3SAT (1,450 words) [view diff] case mismatch in snippet view article find links to article

NP. An approximation within a factor of 2 can be achieved with this simple algorithm, however: Output the solution in which most clauses are satisfied,

Vertex cover (2,542 words) [view diff] case mismatch in snippet view article find links to article

set C is at most 2 times as large as the optimal vertex cover. This simple algorithm was discovered independently by Fanica Gavril and Mihalis Yannakakis

Table of costs of operations in elliptic curves (610 words) [view diff] case mismatch in snippet view article find links to article

P+[k_{(l-1)}2^{l-1}]P+\dots +[k_{1}2]P+[k_{0}]P} . Note that, this simple algorithm takes at most 2l steps and each step consists of a doubling and (if

Laver table (792 words) [view diff] case mismatch in snippet view article find links to article

entries of a Laver table directly, but Patrick Dehornoy provides a simple algorithm for filling out Laver tables. For all p, q in {1,...,2n}: 2 n ⋆

Algorithmic efficiency (3,288 words) [view diff] case mismatch in snippet view article find links to article

{\displaystyle O(n^{2})} quadratic Multiplying two n-digit numbers by a simple algorithm; bubble sort (worst case or naive implementation), Shell sort, quicksort

Hexadecimal (5,702 words) [view diff] case mismatch in snippet view article find links to article

digits in groups of either three or four. As with all bases there is a simple algorithm for converting a representation of a number to hexadecimal by doing

Gradient descent (5,280 words) [view diff] case mismatch in snippet view article find links to article

real symmetric and positive-definite matrix A {\displaystyle A} , a simple algorithm can be as follows, repeat in the loop: r := b − A x γ := r T r / r

Automatic label placement (1,545 words) [view diff] case mismatch in snippet view article find links to article

same time. The algorithm ends after reaching some local optimum. A simple algorithm – simulated annealing – yields good results with relatively good performance

Partial-redundancy elimination (518 words) [view diff] case mismatch in snippet view article find links to article

Conference on PLDI. Paleri, V. K., Srikant, Y. N., and Shankar, P. A Simple Algorithm for Partial Redundancy Elimination. SIGPLAN Notices, Vol. 33(12). pages

Eigendecomposition of a matrix (4,969 words) [view diff] case mismatch in snippet view article find links to article

provided that there is only one eigenvalue of greatest magnitude). This simple algorithm is useful in some practical applications; for example, Google uses

Hunt–Szymanski algorithm (972 words) [view diff] case mismatch in snippet view article find links to article

dots represent candidates that would have to be considered by the simple algorithm and the black lines are connections that create common subsequences

Chedworth Roman Villa (2,101 words) [view diff] case mismatch in snippet view article find links to article

and Toussaint, G. T. “Unraveling Roman mosaic meander patterns: A simple algorithm for their generation,” Archived 8 October 2018 at the Wayback Machine

Exponentiation by squaring (3,378 words) [view diff] case mismatch in snippet view article find links to article

{1}}0)_{\text{NAF}}} . This representation always has minimal Hamming weight. A simple algorithm to compute the NAF representation of a given integer n = ( n l n l

Kendall rank correlation coefficient (4,619 words) [view diff] case mismatch in snippet view article find links to article

}}j^{\text{th}}{\text{ group of ties for the second quantity}}\end{aligned}}} A simple algorithm developed in BASIC computes Tau-b coefficient using an alternative

Gaussian function (4,945 words) [view diff] case mismatch in snippet view article find links to article

1162–1167. doi:10.1021/ac00297a041. ISSN 0003-2700. Hongwei Guo, "A simple algorithm for fitting a Gaussian function," IEEE Sign. Proc. Mag. 28(9): 134-137

Chi-squared distribution (6,375 words) [view diff] case mismatch in snippet view article find links to article

distribution of various statistics, e. g. Σx², for a normal population Simple algorithm for approximating cdf and inverse cdf for the chi-squared distribution

Janusz Brzozowski (computer scientist) (985 words) [view diff] case mismatch in snippet view article

noncounting classes. Second, Brzozowski's algorithm, a conceptually simple algorithm for performing DFA minimization. Third, the Brzozowski derivative of

Bounding sphere (1,516 words) [view diff] case mismatch in snippet view article find links to article

implementation of Welzl's algorithm. In 1990, Jack Ritter proposed a simple algorithm to find a non-minimal bounding sphere. It is widely used in various

Protein aggregation predictors (2,523 words) [view diff] case mismatch in snippet view article find links to article

Makin, O. Sumner; Goedert, Michel; Serpell, Louise C. (May 2007). "A simple algorithm locates β-strands in the amyloid fibril core of α-synuclein, Aβ, and

Alphabetical order (5,305 words) [view diff] case mismatch in snippet view article find links to article

a version of alphabetical order that can be achieved using a very simple algorithm, based purely on the ASCII or Unicode codes for characters. This may

Chow–Liu tree (1,341 words) [view diff] case mismatch in snippet view article find links to article

the distance between the two distributions. Chow and Liu provide a simple algorithm for constructing the optimal tree; at each stage of the procedure the

ISO week date (3,238 words) [view diff] case mismatch in snippet view article find links to article

cycle in a complex, seemingly random pattern. (However, a relatively simple algorithm to determine whether a year has 53 weeks from its ordinal number alone

Lucas–Lehmer primality test (3,467 words) [view diff] case mismatch in snippet view article find links to article

an odd prime. The primality of p can be efficiently checked with a simple algorithm like trial division since p is exponentially smaller than Mp. Define

Kendall tau distance (1,539 words) [view diff] case mismatch in snippet view article find links to article

_{2}(j)} . There are several algorithms for calculating this number. A simple algorithm based on merge sort requires time O ( n log ⁡ n ) {\displaystyle O(n\log

TCP hole punching (1,271 words) [view diff] case mismatch in snippet view article find links to article

port allocation can be one of the two: predictable the gateway uses a simple algorithm to map the local port to the NAT port. Most of the time a NAT will

Four fours (2,161 words) [view diff] case mismatch in snippet view article find links to article

fives and the six sixes problem, both shown below) may be solved by a simple algorithm. The basic ingredients are hash tables that map rationals to strings

Binary heap (4,887 words) [view diff] case mismatch in snippet view article find links to article

log n) comparisons. The view also presents a new and conceptually simple algorithm for merging heaps. When merging is a common task, a different heap

Forth (programming language) (5,450 words) [view diff] case mismatch in snippet view article

grammar has no official specification. Instead, it is defined by a simple algorithm. The interpreter reads a line of input from the user input device,

Exponential backoff (3,330 words) [view diff] case mismatch in snippet view article find links to article

protocol for users to estimate the system state, he would create a simple algorithm for each user to use its own local information, i.e., the number of

Indifference graph (1,898 words) [view diff] case mismatch in snippet view article find links to article

doi:10.1016/0020-0190(85)90050-X, MR 0801816. Ibarra, Louis (2009), "A simple algorithm to find Hamiltonian cycles in proper interval graphs", Information

Bit-reversal permutation (1,554 words) [view diff] case mismatch in snippet view article find links to article

In the random-access machine commonly used in algorithm analysis, a simple algorithm that scans the indexes in input order and swaps whenever the scan encounters

Fuzzy logic (6,680 words) [view diff] case mismatch in snippet view article find links to article

whether a given choice table defines a fuzzy logic function and a simple algorithm of fuzzy logic function synthesis has been proposed based on introduced

Collision detection (4,657 words) [view diff] case mismatch in snippet view article find links to article

case, binary space partitioning trees provide a viable, efficient and simple algorithm for checking if a point is embedded in the scenery or not. Such a data

Collision detection (4,657 words) [view diff] case mismatch in snippet view article find links to article

case, binary space partitioning trees provide a viable, efficient and simple algorithm for checking if a point is embedded in the scenery or not. Such a data

Bit-reversal permutation (1,554 words) [view diff] case mismatch in snippet view article find links to article

In the random-access machine commonly used in algorithm analysis, a simple algorithm that scans the indexes in input order and swaps whenever the scan encounters

Sergei Evdokimov (963 words) [view diff] case mismatch in snippet view article find links to article

of algorithms in algebra and number theory, he found a delicate and simple algorithm for factorization of polynomials over finite fields. The algorithm

Flood fill (3,005 words) [view diff] case mismatch in snippet view article find links to article

different visiting orders, so they don't stay in the same area). Very simple algorithm - easy to make bug-free. Uses a lot of memory, particularly when using

Robotron: 2084 (4,284 words) [view diff] case mismatch in snippet view article find links to article

Enforcers to simulate enemy artificial intelligence. The developers felt a simple algorithm of shooting directly at the protagonist would be ineffective because

Subset sum problem (3,705 words) [view diff] case mismatch in snippet view article find links to article

number in (0,1) called the approximation ratio. The following very simple algorithm has an approximation ratio of 1/2: Order the inputs by descending value;

Crossing number (graph theory) (3,128 words) [view diff] case mismatch in snippet view article

and Leighton. In practice heuristic algorithms are used, such as the simple algorithm which starts with no edges and continually adds each new edge in a

Hilbert's tenth problem (3,132 words) [view diff] case mismatch in snippet view article find links to article

{\displaystyle 2n+4} is the sum of two prime numbers. Of course there is a simple algorithm to test a given number for being the sum of two primes. In fact the

Maximin share (11,167 words) [view diff] case mismatch in snippet view article find links to article

Taki presented a simple algorithm for 2/3-fraction MMS-fairness whose analysis is also simple. Garg and Taki presented: A simple algorithm for 3/4-fraction

Poisson distribution (10,959 words) [view diff] case mismatch in snippet view article find links to article

lambda); GNU Scientific Library (GSL): function gsl_ran_poisson A simple algorithm to generate random Poisson-distributed numbers (pseudo-random number

Traumatic cardiac arrest (1,312 words) [view diff] case mismatch in snippet view article find links to article

Lyon, Richard M.; Davies, Gareth E. (June 2013). "Development of a simple algorithm to guide the effective management of traumatic cardiac arrest". Resuscitation

Lionel Kearns (1,717 words) [view diff] case mismatch in snippet view article find links to article

Consisting of a zero made of ones encircling a one made of zeros, it is a simple algorithm that generates any number of distinct physical iterations. BoG/uVr

Julia set (5,692 words) [view diff] case mismatch in snippet view article find links to article

n ( z ) . {\displaystyle \bigcup _{n}f^{-n}(z).} (This suggests a simple algorithm for plotting Julia sets, see below.) If f is an entire function, then

Bipolar orientation (1,839 words) [view diff] case mismatch in snippet view article find links to article

depth-first search) is suitable for parallel computation. A modern and simple algorithm that computes st-numberings and -orientations in linear time is given

Streaming algorithm (3,578 words) [view diff] case mismatch in snippet view article find links to article

S2CID 10006932.. Karp, R. M.; Papadimitriou, C. H.; Shenker, S. (2003), "A simple algorithm for finding frequent elements in streams and bags", ACM Transactions

Max-flow min-cut theorem (3,428 words) [view diff] case mismatch in snippet view article find links to article

38, Princeton, New Jersey L. R. Ford & D. R. Fulkerson (1957) "A simple algorithm for finding the maximum network flows and an application to the Hitchcock

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

generation was implemented into the game, the team was unhappy about its simple algorithm and instead shifted their design focus to static, pre-built worlds

Feature learning (5,074 words) [view diff] case mismatch in snippet view article find links to article

functions of the data matrix. The singular vectors can be generated via a simple algorithm with p iterations. In the ith iteration, the projection of the data

Dominating set (4,070 words) [view diff] case mismatch in snippet view article find links to article

the size of a minimum set cover for (U, S). Furthermore, there is a simple algorithm that maps a dominating set to a set cover of the same size and vice

Machine epsilon (2,802 words) [view diff] case mismatch in snippet view article find links to article

doubles give 2.220446e-16, which is 2−52 as expected. The following simple algorithm can be used to approximate[clarification needed] the machine epsilon

Straight skeleton (2,179 words) [view diff] case mismatch in snippet view article find links to article

Huber, Stefan; Kaaser, Dominik; Palfrader, Peter (February 2015). "A Simple Algorithm for Computing Positively Weighted Straight Skeletons of Monotone Polygons"

Vladimir Korepin (1,696 words) [view diff] case mismatch in snippet view article find links to article

S2CID 115174731. Korepin, Vladimir E.; Grover, Lov K. (2005). "Simple Algorithm for Partial Quantum Search". Quantum Information Processing. 5 (1):

Normal distribution (22,359 words) [view diff] case mismatch in snippet view article find links to article

via Rational Chebyshev Approximation. Marsaglia (2004) suggested a simple algorithm based on the Taylor series expansion Φ ( x ) = 1 2 + φ ( x ) ( x +

Fair allocation of items and money (3,950 words) [view diff] case mismatch in snippet view article find links to article

and one item, it is possible to attain fairness using the following simple algorithm (which is a variant of cut and choose): Alice says a price p that she

Point Cloud Library (3,250 words) [view diff] case mismatch in snippet view article find links to article

that support various segmentation methods: Plane model segmentation - simple algorithm that finds all the points that support a plane model in the point cloud

Evolutionary game theory (7,084 words) [view diff] case mismatch in snippet view article find links to article

famous and one of the most successful of these is tit-for-tat with a simple algorithm. def tit_for_tat(last_move_by_opponent): """Defect if opponent defects

Matrix multiplication algorithm (4,327 words) [view diff] case mismatch in snippet view article find links to article

{\displaystyle c_{ij}=\sum _{k=1}^{m}a_{ik}b_{kj}.} From this, a simple algorithm can be constructed which loops over the indices i from 1 through n

Combinatory logic (5,243 words) [view diff] case mismatch in snippet view article find links to article

which the variable x is not free, such that [x]E x = E holds. A very simple algorithm for bracket abstraction is defined by induction on the structure of

ALS Functional Rating Scale - Revised (1,078 words) [view diff] case mismatch in snippet view article find links to article

(2015-06-01). "Predicting prognosis in amyotrophic lateral sclerosis: a simple algorithm". Journal of Neurology. 262 (6): 1447–1454. doi:10.1007/s00415-015-7731-6

Edgeworth series (3,013 words) [view diff] case mismatch in snippet view article find links to article

of the density function. Blinnikov and Moessner (1998) have given a simple algorithm to calculate higher-order terms of the expansion. Note that in case

Maze (1973 video game) (3,481 words) [view diff] case mismatch in snippet view article

multi-level maze, the robot players were much harder to beat despite their simple algorithm. They made the difficulty adjustable in response by letting the player

Terrain-following radar (3,572 words) [view diff] case mismatch in snippet view article find links to article

the terrain with a constant manoeuvring load. One problem with this simple algorithm is that the calculated path will keep the aircraft in positive pitch

Circular permutation in proteins (3,519 words) [view diff] case mismatch in snippet view article find links to article

PMID 8506262. Uliel S, Fliess A, Amir A, Unger R (November 1999). "A simple algorithm for detecting circular permutations in proteins". Bioinformatics. 15

Dirichlet process (4,861 words) [view diff] case mismatch in snippet view article find links to article

from the naive model with exactly K {\displaystyle K} clusters. A simple algorithm for doing this would be to draw K {\displaystyle K} values of μ k {\displaystyle

Farey sequence (4,517 words) [view diff] case mismatch in snippet view article find links to article

is used in the proof of the Franel–Landau theorem. A surprisingly simple algorithm exists to generate the terms of Fn in either traditional order (ascending)

Deterministic scale-free network (819 words) [view diff] case mismatch in snippet view article find links to article

to generate scale-free networks, it is common, that they define a simple algorithm of adding nodes, which is then iteratively repeated and thus leads

Zeta-TCP (818 words) [view diff] case mismatch in snippet view article find links to article

own implementations that are equally suboptimal. Zeta-TCP provides a simple algorithm to calculate the loss probability on every unACK'd/unSACK'd packet

Gerrymandering (17,613 words) [view diff] case mismatch in snippet view article find links to article

Center for Range Voting has proposed a way to draw districts by a simple algorithm. The algorithm uses only the shape of the state, the number N of districts

Algorithm characterizations (8,851 words) [view diff] case mismatch in snippet view article find links to article

There is more consensus on the "characterization" of the notion of "simple algorithm". All algorithms need to be specified in a formal language, and the

TLA+ (5,688 words) [view diff] no match in snippet view article find links to article

(* This action chooses an elevator to service the call. The simple *) (* algorithm picks the closest elevator which is either stationary or *) (* already

Well-separated pair decomposition (1,795 words) [view diff] case mismatch in snippet view article find links to article

S2CID 9758120. Arya, Sunil; Mount, David M. (2016). "A fast and simple algorithm for computing approximate euclidean minimum spanning trees". Proceedings

Elevator (18,278 words) [view diff] case mismatch in snippet view article find links to article

the above article for more information. The elevator algorithm, a simple algorithm by which a single elevator can decide where to stop, is summarized

Maximum parsimony (phylogenetics) (7,404 words) [view diff] case mismatch in snippet view article

the taxa in the analysis. Trees are scored (evaluated) by using a simple algorithm to determine how many "steps" (evolutionary transitions) are required

Angel problem (2,406 words) [view diff] case mismatch in snippet view article find links to article

angel playing a 5-devil (game 2) can achieve a win using a fairly simple algorithm. Bowditch claims that a 4-angel can win the original version of the

IBM System Object Model (2,459 words) [view diff] case mismatch in snippet view article find links to article

in the middle (at least in other COM libraries). SOM instead uses a simple algorithm, looking for potential base classes by following the inheritance tree

Justified representation (5,244 words) [view diff] case mismatch in snippet view article find links to article

EJR. Another polytime algorithm that guarantees EJR is EJR-Exact. A simple algorithm that finds an EJR allocation is called "Greedy EJR". Looping L from

Utilitarian cake-cutting (2,256 words) [view diff] case mismatch in snippet view article find links to article

When the cake is 1-dimensional and the pieces must be connected, the simple algorithm of assigning each piece to the agent that values it the most no longer

Shot transition detection (1,974 words) [view diff] case mismatch in snippet view article find links to article

absolute differences (SAD). This is both the most obvious and most simple algorithm of all: The two consecutive frames are compared pixel by pixel, summing

Block sort (4,902 words) [view diff] case mismatch in snippet view article find links to article

doi:10.1016/S0304-3975(98)00162-5. Hwang, F. K.; Lin, S. (1972). A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets. SIAM Journal on Computing

List of software to detect low complexity regions in proteins (930 words) [view diff] exact match in snippet view article find links to article

(May 2002). "Detecting cryptically simple protein sequences using the SIMPLE algorithm". Bioinformatics. 18 (5): 672–678. doi:10.1093/bioinformatics/18.5

Aanderaa–Karp–Rosenberg conjecture (3,598 words) [view diff] case mismatch in snippet view article find links to article

to a non-empty graph produces another non-empty graph. There is a simple algorithm for testing whether a graph is non-empty: loop through all of the pairs

Convex hull of a simple polygon (1,141 words) [view diff] case mismatch in snippet view article find links to article

seven out of fifteen algorithms as being incorrect. A particularly simple algorithm for this problem was published by Graham & Yao (1983) and Lee (1983)

K-way merge algorithm (2,409 words) [view diff] case mismatch in snippet view article find links to article

min-heap of the k lists, each keyed by their smallest current element. A simple algorithm builds an output buffer with nodes from the heap. Start by building

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

Mathematica Slovaca, 30 (4): 405–417, MR 0595302. Alon, Noga (2003), "A simple algorithm for edge-coloring bipartite multigraphs", Information Processing Letters

FRACTRAN (1,915 words) [view diff] no match in snippet view article find links to article

\left({\frac {3}{2}}\right)} This program can be represented as a (very simple) algorithm as follows: Given an initial input of the form 2 a 3 b {\displaystyle

Microcom Networking Protocol (3,076 words) [view diff] case mismatch in snippet view article find links to article

MNP 5, the data received from the computer are first compressed with a simple algorithm, and then passed into the MNP 4 packetizing system for transmission

Bin covering problem (2,684 words) [view diff] case mismatch in snippet view article find links to article

FPTAS. Csirik, Frenk, Lebbe and Zhang: 16–19 present the following simple algorithm for 2/3 approximation. Suppose the bin size is 1 and there are n items

Machine olfaction (3,110 words) [view diff] case mismatch in snippet view article find links to article

modeling, different algorithms can be used to localize the odor source. A simple algorithm that can be used for location estimation is the triangulation method

E-democracy (13,808 words) [view diff] case mismatch in snippet view article find links to article

organize meetings to scrutinize and debate these ideas, and employ a simple algorithm to identify true representatives of the public will. The theme of e-democracy

Michel Raynal (1,499 words) [view diff] case mismatch in snippet view article find links to article

algorithms. On the causality side, with co-workers he produced a very simple algorithm for causal message delivery, and an optimal vector-clock-based distributed

Bloom filter (10,837 words) [view diff] case mismatch in snippet view article find links to article

remove any other elements that happen to map onto that bit. Since the simple algorithm provides no way to determine whether any other elements have been added

Szemerédi regularity lemma (6,159 words) [view diff] case mismatch in snippet view article find links to article

ISBN 0-8186-7594-2, S2CID 38681854 Frieze, Alan; Kannan, Ravi (March 1999), "A simple algorithm for constructing Szemerédi's regularity partition", The Electronic

In-place matrix transposition (3,044 words) [view diff] case mismatch in snippet view article find links to article

submatrices above and below the diagonal. (When N is sufficiently small, the simple algorithm above is used as a base case, as naively recurring all the way down

Biomedical text mining (6,752 words) [view diff] case mismatch in snippet view article find links to article

PMC 2586758. PMID 19025695. Schwartz AS, Hearst MA (2003). "A simple algorithm for identifying abbreviation definitions in biomedical text". Pacific

Algorithmic bias (13,853 words) [view diff] case mismatch in snippet view article find links to article

A 1969 diagram for how a simple computer program makes decisions, illustrating a very simple algorithm

Euclidean minimum spanning tree (6,649 words) [view diff] case mismatch in snippet view article find links to article

ISBN 978-3-642-13192-9 Arya, Sunil; Mount, David M. (2016), "A fast and simple algorithm for computing approximate Euclidean minimum spanning trees", in Krauthgamer

Voter identification laws in the United States (14,006 words) [view diff] case mismatch in snippet view article find links to article

Laws Do Not Reduce Turnout" (PDF). The Heritage Foundation. "A Dead-Simple Algorithm Reveals the True Toll of Voter ID Laws". Wired. Retrieved January 4

Classification System for Serial Criminal Patterns (1,515 words) [view diff] case mismatch in snippet view article find links to article

The Kohonen network is an unsupervised learning network that uses a simple algorithm to make computations without needing to know the type or number of

List of Westworld characters (7,475 words) [view diff] case mismatch in snippet view article find links to article

Ford had built in Westworld to capture guests' behavior and devise a simple algorithm for it. Serac recognized that with this algorithm he would be able

Group testing (9,937 words) [view diff] case mismatch in snippet view article find links to article

performing a binary search on groups that test positive, and is a simple algorithm that finds a single defective in no more than the information-lower-bound

Integrating ADC (4,969 words) [view diff] case mismatch in snippet view article find links to article

which reference voltage should be applied. This can be a relatively simple algorithm: if the integrator's output above the threshold, enable the positive

History of logarithms (5,460 words) [view diff] case mismatch in snippet view article find links to article

additional table of reciprocals (or the knowledge of a sufficiently simple algorithm to generate reciprocals). Large tables of quarter squares were used

Hindley–Milner type system (8,445 words) [view diff] case mismatch in snippet view article find links to article

claimed that this algebraic formulation was equivalent to a relatively simple algorithm resembling Algorithm W, and that the use of union and intersection

Leonardo Torres Quevedo (12,595 words) [view diff] case mismatch in snippet view article find links to article

within the 50 moves allotted by the fifty-move rule, because of the simple algorithm that calculates the moves. It did, however, checkmate the opponent

List of Marathi people in science, engineering and technology (2,670 words) [view diff] exact match in snippet view article find links to article

development of Param supercomputers. Suhas Patankar – Inventor of the SIMPLE algorithm for solution of Navier-Stokes equation that revolutionised the world

LCP array (4,376 words) [view diff] case mismatch in snippet view article find links to article

006. S2CID 5492217. Crochemore, M.; Ilie, L.; Smyth, W. F. (2008). A Simple Algorithm for Computing the Lempel Ziv Factorization. Data Compression Conference

Burst error-correcting code (9,228 words) [view diff] case mismatch in snippet view article find links to article

by g ( x ) {\displaystyle g(x)} as well. The above proof suggests a simple algorithm for burst error detection/correction in cyclic codes: given a transmitted

SIRIUS (software) (5,845 words) [view diff] case mismatch in snippet view article

2024. Bocker, Sebastian; Liptak, Zsuzsanna (August 2007). "A Fast and Simple Algorithm for the Money Changing Problem". Algorithmica. 48 (4): 413–432. doi:10