Hand
W
iki
Encyclopedia of Knowledge
Home
Searching: "
algorithm
"
Back
DPLL algorithm
[62%]
(Computing)
[
Automated theorem proving
] [
Constraint programming
] This is known as the splitting rule , as it splits ...
Elevator algorithm
[62%]
(Computing)
[
Sorting algorithms
] Disk-scheduling algorithm ...
Quine–McCluskey algorithm
[62%]
(Computing)
[
Boolean algebra
] Algorithm for the minimization of Boolean functions ...
Sorting algorithm
[62%]
(Computing)
[
Data processing
] [
Sorting algorithms
] Algorithm that arranges lists in order ...
Tarski–Kuratowski algorithm
[62%]
(Computing)
[
Theory of computation
] [
Computability theory
] ...
Markov algorithm
[62%]
(Computing)
[
Models of computation
] [
Theory of computation
] The scheme is a finite ordered set of substitution formulas . ...
Merge algorithm
[62%]
(Computing)
[
Sorting algorithms
] Algorithm that combines multiple sorted lists into one ...
Chaff algorithm
[62%]
(Computing)
[
Constraint programming
] [
Automated theorem proving
] [
Boolean algebra
] Chaff is an algorithm for solving instances of the Boolean satisfiability ...
Deutsch–Jozsa algorithm
[62%]
(Computing)
[
Quantum algorithms
] Deterministic quantum algorithm ...
Dijkstra–Scholten algorithm
[62%]
(Computing)
[
Graph algorithms
] The Dijkstra–Scholten algorithm (named after Edsger W. Dijkstra and Carel S. ...
Dinic's algorithm
[62%]
(Computing)
[
Graph algorithms
] Dinic's algorithm or Dinitz's algorithm is a strongly polynomial algorithm for ...
FKT algorithm
[62%]
(Computing)
[
Planar graphs
] [
Graph algorithms
] Algorithm for counting perfect matchings in planar graphs ...
Edmonds–Karp algorithm
[62%]
(Computing)
[
Graph algorithms
] Algorithm to compute the maximum flow in a flow network ...
BHT algorithm
[62%]
(Computing)
[
Quantum algorithms
] If there is a collision among these inputs, then we return ...
Ford–Fulkerson algorithm
[62%]
(Computing)
[
Graph algorithms
] Algorithm to compute the maximum flow in a flow network (equivalently; ...
Johnson's algorithm
[62%]
(Computing)
[
Search algorithms
] [
Graph algorithms
] Computer-based path-finding method ...
Girvan–Newman algorithm
[62%]
(Computing)
[
Network analysis
] [
Networks
] [
Graph algorithms
] Community detection algorithm ...
Chaitin's algorithm
[62%]
(Computing)
[
Graph algorithms
] Register allocation algorithm ...
Flooding algorithm
[62%]
(Computing)
[
Routing algorithms
] [
Graph algorithms
] Class of algorithms ...
Bellman–Ford algorithm
[62%]
(Computing)
[
Dynamic programming
] [
Articles with example C code
] [
Polynomial-time problems
] The Bellman–Ford algorithm is an algorithm that computes shortest paths from ...
Bernstein-Vazirani algorithm
[62%]
(Computing)
[
Quantum algorithms
] The Bernstein-Vazirani algorithm is a quantum algorithm invented by Ethan Bernstein ...
Fortune's algorithm
[62%]
(Computing)
[
Computational geometry
] Voronoi diagram generation algorithm ...
Suurballe's algorithm
[62%]
(Computing)
[
Routing algorithms
] [
Graph algorithms
] Algorithm for two disjoint paths in a graph ...
Havel–Hakimi algorithm
[62%]
(Computing)
[
Graph algorithms
] Algorithm in graph theory ...
Sethi–Ullman algorithm
[62%]
(Computing)
[
Graph algorithms
] [
Compiler construction
] ...
Aharonov–Jones–Landau algorithm
[62%]
(Computing)
[
Quantum algorithms
] ...
Edmonds' algorithm
[62%]
(Computing)
[
Graph algorithms
] Algorithm for the directed version of the minimum spanning tree problem ...
Floyd–Warshall algorithm
[62%]
(Computing)
[
Dynamic programming
] [
Polynomial-time problems
] [
Routing algorithms
] Although it does not return details of the paths themselves, it ...
Yen's algorithm
[62%]
(Computing)
[
Polynomial-time problems
] [
Graph algorithms
] This means that the deviation path cannot deviate from the shortest ...
Lubachevsky–Stillinger algorithm
[62%]
(Computing)
[
Granularity of materials
] [
Simulation
] [
Computational physics
] Computational physics simulation algorithm ...
Dijkstra's algorithm
[62%]
(Computing)
[
Combinatorial optimization
] [
Routing algorithms
] [
Search algorithms
] Graph search algorithm ...
Water-pouring algorithm
[62%]
(Computing)
[
Information theory
] The water-pouring algorithm is a technique used in digital communications systems ...
Gale–Shapley algorithm
[62%]
(Computing)
[
Combinatorial algorithms
] Procedure for finding a stable matching ...
Pan–Tompkins algorithm
[62%]
(Computing)
[
Cardiac electrophysiology
] [
Algorithms
] Heart rate measuring algorithm used in ECGs ...
Gibbs algorithm
[62%]
(Computing)
[
Entropy and information
] [
Particle statistics
] [
Statistical mechanics
] Criterion for choosing a probability distribution in statistical mechanics ...
A-law algorithm
[62%]
(Computing)
[
Audio codecs
] Algorithm Global 64-bit PCM ...
Coffman–Graham algorithm
[62%]
(Computing)
[
Graph drawing
] Method for partitioning partial orders into levels ...
Datafly algorithm
[62%]
(Computing)
[
Obfuscation
] [
Data protection
] Datafly algorithm is an algorithm for providing anonymity in medical data ...
Min-conflicts algorithm
[62%]
(Computing)
[
Constraint programming
] Search algorithm or heuristic method to solve constraint satisfaction problems ...
Smith–Waterman algorithm
[62%]
(Computing)
[
Dynamic programming
] [
Sequence alignment algorithms
] [
Computational phylogenetics
] Algorithm for determining similar regions between two molecular sequences ...
Needleman–Wunsch algorithm
[62%]
(Computing)
[
Dynamic programming
] [
Computational phylogenetics
] [
Sequence alignment algorithms
] Method for aligning biological sequences ...
Ukkonen's algorithm
[62%]
(Computing)
[
Substring indices
] [
Algorithms on strings
] [
Bioinformatics algorithms
] Algorithm for construction of suffix trees ...
Pairwise Algorithm
[62%]
(Computing)
[
Bioinformatics algorithms
] A Pairwise Algorithm is an algorithmic technique with its origins in ...
Kabsch algorithm
[62%]
(Computing)
[
Bioinformatics algorithms
] The Kabsch algorithm , also known as the Kabsch-Umeyama algorithm , ...
YDS algorithm
[62%]
(Computing)
[
Real-time computing
] YDS is a scheduling algorithm for dynamic speed scaling processors which ...
Interchangeability algorithm
[62%]
(Computing)
[
Constraint programming
] Technique to solve constraint satisfaction problems ...
Island algorithm
[62%]
(Computing)
[
Bioinformatics algorithms
] The island algorithm is an algorithm for performing inference on hidden ...
AC-3 algorithm
[62%]
(Computing)
[
Constraint programming
] Algorithms in constraint satisfaction ...
SALSA algorithm
[62%]
(Computing)
[
Link analysis
] [
Internet search algorithms
] Ranking algorithm ...
Hybrid algorithm
[62%]
(Computing)
[
Constraint programming
] Constraint satisfaction; In particular, backtracking or some other form of search is run ...
Hirschberg's algorithm
[62%]
(Computing)
[
Dynamic programming
] [
Bioinformatics algorithms
] [
Sequence alignment algorithms
] Algorithm for aligning two sequences ...
Benson's algorithm
[62%]
(Computing)
[
Optimization algorithms and methods
] [
Linear programming
] Benson's algorithm , named after Harold Benson, is a method for ...
Broyden–Fletcher–Goldfarb–Shanno algorithm
[62%]
(Computing)
[
Optimization algorithms and methods
] Optimization method ...
Fireworks algorithm
[62%]
(Computing)
[
Optimization algorithms and methods
] The Fireworks Algorithm (FWA) is a swarm intelligence algorithm that explores ...
MCS algorithm
[62%]
(Computing)
[
Optimization algorithms and methods
] After additional 21 evaluations the optimal value is not improved and ...
Fly algorithm
[62%]
(Computing)
[
Evolutionary computation
] [
Nature-inspired metaheuristics
] [
Evolutionary algorithms
] To this end, the fitness function uses the grey levels, colours ...
Lawler's algorithm
[62%]
(Computing)
[
Mathematical optimization in business
] [
Industrial engineering
] [
Optimization algorithms and methods
] Lawler's algorithm is a powerful technique for solving a variety of ...
Karmarkar's algorithm
[62%]
(Computing)
[
Linear programming
] [
Optimization algorithms and methods
] Karmarkar's algorithm is an algorithm introduced by Narendra Karmarkar in 1984 ...
Lemke's algorithm
[62%]
(Computing)
[
Optimization algorithms and methods
] ...
MM algorithm
[62%]
(Computing)
[
Optimization algorithms and methods
] The MM algorithm is an iterative optimization method which exploits the ...
Ruzzo–Tompa algorithm
[62%]
(Computing)
[
Dynamic programming
] [
Optimization algorithms and methods
] The Ruzzo–Tompa algorithm or the RT algorithm is a linear-time algorithm ...
Simplex algorithm
[62%]
(Computing)
[
Linear programming
] [
Exchange algorithms
] [
Optimization algorithms and methods
] Algorithm for linear programming ...
Auction algorithm
[62%]
(Computing)
[
Auction theory
] [
Optimization algorithms and methods
] The term " auction algorithm " Dimitri P. Bertsekas ...
Schreier–Sims algorithm
[62%]
(Computing)
[
Permutation groups
] Algorithm for solving various problems in computational group theory ...
Banker's algorithm
[62%]
(Computing)
[
Concurrency control algorithms
] Algorithm used for program correctness ...
Lesk algorithm
[62%]
(Computing)
[
Computational linguistics
] [
Natural language processing
] Natural language processing algorithm ...
Inside–outside algorithm
[62%]
(Computing)
[
Parsing algorithms
] Parameter estimation method for probabilistic context-free grammars ...
Wake-sleep algorithm
[62%]
(Computing)
[
Machine learning algorithms
] Unsupervised learning algorithm ...
Steensgaard's algorithm
[62%]
(Computing)
[
Static program analysis
] ...
Karn's algorithm
[62%]
(Computing)
[
Transmission Control Protocol
] [
Networking algorithms
] Karn's algorithm addresses the problem of getting accurate estimates of the ...
Rabin–Karp algorithm
[62%]
(Computing)
[
Hashing
] String searching algorithm ...
Astronomical algorithm
[62%]
(Astronomy)
[
Computational physics
] [
Astrodynamics
] Astronomical algorithms are the algorithms used to calculate ephemerides, calendars, and ...
Hunt–Szymanski algorithm
[62%]
(Computing)
[
Dynamic programming
] [
Combinatorics
] [
Algorithms on strings
] The -candidates are marked on the grid ...
Fürer's algorithm
[62%]
(Computing)
[
Computer arithmetic algorithms
] Fürer's algorithm is an integer multiplication algorithm for extremely large integers ...
Wagner–Fischer algorithm
[62%]
(Computing)
[
String metrics
] [
Algorithms on strings
] Programming algorithm ...
CYK algorithm
[62%]
(Computing)
[
Parsing algorithms
] Parsing algorithm for context-free grammars ...
Chan's algorithm
[62%]
(Computing)
[
Convex hull algorithms
] Algorithm for finding the convex hull of a set of points ...
Warnock algorithm
[62%]
(Computing)
[
Computer graphics algorithms
] Computer graphics algorithm ...
BRST algorithm
[62%]
(Computing)
[
Stochastic optimization
] Boender-Rinnooy-Stougie-Timmer algorithm (BRST) is an optimization algorithm suitable for finding global ...
Memetic algorithm
[62%]
(Computing)
[
Evolutionary algorithms
] A memetic algorithm (MA) in computer science and operations research, is ...
Shunting-yard algorithm
[62%]
(Computing)
[
Parsing algorithms
] ...
HITS algorithm
[62%]
(Computing)
[
Link analysis
] Hyperlink-Induced Topic Search ( HITS ; also known as hubs and ...
Spigot algorithm
[62%]
(Computing)
[
Computer arithmetic algorithms
] Algorithm for computing the value of a transcendental number ...
Ruppert's algorithm
[62%]
(Computing)
[
Triangulation (geometry)
] [
Mesh generation
] A triangle is considered poor-quality if it has a circumradius to ...
Gauss–Legendre algorithm
[62%]
(Computing)
[
Pi algorithms
] Quickly converging computation of π ...
Newman–Janis algorithm
[62%]
(Computing)
[
Exact solutions in general relativity
] [
Algorithms
] Technique to find exact solutions to Einstein field equations ...
Pocklington's algorithm
[62%]
(Computing)
[
Number theoretic algorithms
] [
Modular arithmetic
] Pocklington's algorithm is a technique for solving a congruence of the ...
TPK algorithm
[62%]
(Computing)
[
Articles with example ALGOL 60 code
] Program to compare computer programming languages ...
Pohlig–Hellman algorithm
[62%]
(Computing)
[
Number theoretic algorithms
] Algorithm for computing logarithms ...
Cultural algorithm
[62%]
(Computing)
[
Nature-inspired metaheuristics
] [
Genetic algorithms
] [
Evolutionary algorithms
] Cultural algorithms (CA) are a branch of evolutionary computation where there ...
Chudnovsky algorithm
[62%]
(Computing)
[
Pi algorithms
] Fast method for calculating the digits of π ...
Raymond's algorithm
[62%]
(Computing)
[
Concurrency control algorithms
] Raymond's Algorithm is a lock based algorithm for mutual exclusion on ...
Eight-point algorithm
[62%]
(Computing)
[
Geometry in computer vision
] The eight-point algorithm is an algorithm used in computer vision to ...
Integrable algorithm
[62%]
(Computing)
[
Partial differential equations
] [
Integrable systems
] Numerical algorithms based on integrable systems ...
Concurrent algorithm
[62%]
(Computing)
[
Concurrent algorithms
] ...
Maekawa's algorithm
[62%]
(Computing)
[
Concurrency control algorithms
] Maekawa's algorithm is an algorithm for mutual exclusion on a distributed ...
Day–Stout–Warren algorithm
[62%]
(Computing)
[
Amortized data structures
] [
Search trees
] Method for efficiently balancing binary search trees ...
Bulirsch–Stoer algorithm
[62%]
(Computing)
[
Numerical integration (quadrature)
] ...
Szymański's algorithm
[62%]
(Computing)
[
Concurrency control algorithms
] Szymański's Mutual Exclusion Algorithm is a mutual exclusion algorithm devised by ...
Luleå algorithm
[62%]
(Computing)
[
Routing algorithms
] [
Networking algorithms
] [
Routing software
] Technique for storing and searching internet routing tables ...
BKM algorithm
[62%]
(Computing)
[
Digit-by-digit algorithms
] [
Shift-and-add algorithms
] [
Computer arithmetic
] Shift-and-add algorithm ...
CN2 algorithm
[62%]
(Computing)
[
Machine learning algorithms
] The CN2 induction algorithm is a learning algorithm for rule induction. ...
Borwein's algorithm
[62%]
(Computing)
[
Pi algorithms
] Method for calculating pi ...
Cornacchia's algorithm
[62%]
(Computing)
[
Number theoretic algorithms
] ...
Cheney's algorithm
[62%]
(Computing)
[
Automatic memory management
] Cheney's algorithm , first described in a 1970 ACM paper by ...
Bat algorithm
[62%]
(Computing)
[
Nature-inspired metaheuristics
] The Bat algorithm is a metaheuristic algorithm for global optimization. It ...
Bees algorithm
[62%]
(Computing)
[
Nature-inspired metaheuristics
] In 2005. Pham DT, Ghanbarzadeh A, Koc E, Otri S, Rahim ...
Firefly algorithm
[62%]
(Computing)
[
Nature-inspired metaheuristics
] ...
Feynman's algorithm
[62%]
(Computing)
[
Quantum algorithms
] Feynman's algorithm is an algorithm that is used to simulate the ...
LASCNN algorithm
[62%]
(Computing)
[
Graph algorithms
] [
Network theory
] [
Networks
] In graph theory, LASCNN is a L ocalized A lgorithm for ...
KBD algorithm
[62%]
(Computing)
[
Monte Carlo methods
] [
Statistical mechanics
] Cluster update algorithm ...
Tarjan's algorithm
[62%]
(Computing)
[
Mathematics-related lists
] [
Algorithms
] ...
Birkhoff algorithm
[62%]
(Computing)
[
Algorithms
] Tool for working with matrices ...
Nussinov algorithm
[62%]
(Computing)
[
Bioinformatics algorithms
] Nucleic acid structure prediction algorithm ...
Lion algorithm
[62%]
(Computing)
[
Algorithms
] Lion algorithm (LA) is one among the bio-inspired (or) nature-inspired optimization ...
Lentz's algorithm
[62%]
(Computing)
[
Special hypergeometric functions
] He developed a new continued fraction technique for calculating the ratios ...
Bug algorithm
[62%]
(Computing)
[
Robot kinematics
] ...
Algorithm aversion
[62%]
(Computing)
[
Algorithmic information theory
] Biased assessment of an algorithm ...
Kunerth's algorithm
[62%]
(Computing)
[
Cryptographic algorithms
] [
Algorithms
] Kunerth's algorithm is an algorithm for computing the modular square root ...
Lee algorithm
[62%]
(Engineering)
[
Electronic design automation
] [
Electronic engineering
] Algorithm based on breadth-first search to solve mazes ...
Naranjo algorithm
[62%]
(Medicine)
[
Drug safety
] The Naranjo algorithm , Naranjo Scale , or Naranjo Nomogram is ...
PISO algorithm
[62%]
(Physics)
[
Computational fluid dynamics
] PISO algorithm ( Pressure-Implicit with Splitting of Operators ) was proposed ...
SIMPLE algorithm
[62%]
(Physics)
[
Computational fluid dynamics
] SIMPLE is an acronym for Semi-Implicit Method for Pressure Linked Equations.The ...
SIMPLEC algorithm
[62%]
(Physics)
[
Computational fluid dynamics
] Numerical approximate solution to the Navier–Stokes equations ...
Track algorithm
[62%]
(Physics)
[
Radar signal processing
] [
Radar
] A track algorithm is a radar and sonar performance enhancement strategy ...
Featherstone's algorithm
[62%]
(Physics)
[
Computer physics engines
] [
Computational physics
] [
Mechanics
] Featherstone's algorithm is a technique used for computing the effects of ...
Algorithm (C++)
[62%]
(Software)
[
C++ Standard Library
] C++ Standard Library for algorithmic ops ...
Government by algorithm
[62%]
(Philosophy)
[
Transhumanism
] [
Technology in society
] [
Social systems
] Alternative form of government or social ordering ...
Medical algorithm
[62%]
(Medicine)
[
Knowledge representation
] [
Algorithms
] [
Health informatics
] Medical algorithms are not necessarily implemented using digital computers ...
Hilltop algorithm
[62%]
(Social)
[
Reputation management
] The Hilltop algorithm is an algorithm used to find documents relevant ...
Gillespie algorithm
[62%]
(Chemistry)
[
Stochastic simulation
] [
Monte Carlo methods
] [
Computational chemistry
] Method for stochastic equation systems ...
Tomasulo's algorithm
[62%]
(Computing)
[
Instruction processing
] [
Algorithms
] Computer architecture hardware algorithm ...
Yarowsky algorithm
[62%]
(Computing)
[
Natural language processing
] Method in computational linguistics ...
Quantum algorithm
[62%]
(Computing)
[
Quantum algorithms
] [
Theoretical computer science
] [
Quantum computing
] Algorithms run on quantum computers, typically relying on superposition and/or entanglement ...
HHL algorithm
[62%]
(Computing)
[
Articles containing proofs
] [
Integer factorization algorithms
] [
Quantum algorithms
] Quantum linear algebra algorithm offering exponential speedup under certain conditions ...
MaxCliqueDyn algorithm
[62%]
(Computing)
[
Graph algorithms
] ...
GYO algorithm
[62%]
(Computing)
[
Graph algorithms
] [
Database algorithms
] The GYO algorithm is an algorithm that applies to hypergraphs ...
Yannakakis algorithm
[62%]
(Computing)
[
Database algorithms
] [
Database theory
] The join tree is a tree structure that contains the query ...
Multifit algorithm
[62%]
(Computing)
[
Bin packing
] Optimization algorithm in computer science ...
Leiden algorithm
[62%]
(Computing)
[
Network theory
] [
Algorithms
] Clustering and community detection algorithm ...
March algorithm
[62%]
(Computing)
[
Algorithms
] A memory testing algorithm ...
Pivot algorithm
[62%]
(Computing)
[
Randomized algorithms
] The red monomer is chosen as the pivot point ...
Pointer algorithm
[62%]
(Computing)
[
Algorithms
] ...
Paranoid algorithm
[62%]
(Computing)
[
Combinatorial game theory
] [
Optimization algorithms and methods
] Algorithm in game theory ...
Education by algorithm
[62%]
(Software)
[
Algorithms
] [
Technology in society
] [
Applications of artificial intelligence
] Education by algorithm refers to automated solutions that algorithmic agents or ...
Chandrasekhar algorithm
[62%]
(Computing)
[
Ordinary differential equations
] Chandrasekhar algorithm refers to an efficient method to solve matrix Riccati ...
Algorithm in an alphabet
[62%]
(Computing)
[
Mathematics
] (1961) (Translated from Russian) (Also: Trudy Mat ...
Algorithm, local
[62%]
(Computing)
[
Mathematics
] An algorithm which specifies the attributes of elements of a structured ...
Algorithm, representation of an
[62%]
(Computing)
[
Mathematics
] The resulting words are then written out, one after the other, ...
Alternating algorithm
[62%]
(Computing)
[
Mathematics
] !--This article has been texified automatically ...
Buchberger algorithm
[62%]
(Computing)
[
Mathematics
] ...
Computational algorithm
[62%]
(Computing)
[
Mathematics
] An exactly defined specification of the operations to be carried out ...
Dijkstra algorithm
[62%]
(Computing)
[
Mathematics
] 111–178 [a2] "Encyclopedia of Operations Research and Management Science" S.I. Gass ...
EM algorithm
[62%]
(Computing)
[
Mathematics
] !--This article has been texified automatically ...
Extrapolation algorithm
[62%]
(Computing)
[
Mathematics
] It canalso be written as $$ T_n \frac S_n & S_ ...
Idempotent algorithm
[62%]
(Computing)
[
Mathematics
] An algorithm based on the concept of idempotent semi-ring (i.e ...
Iteration algorithm
[62%]
(Computing)
[
Mathematics
] A recursive algorithm realizing a sequence of point-to-set mappings $ A ...
Normal algorithm
[62%]
(Computing)
[
Mathematics
] The name attached to algorithms (cf ...
Smolyak algorithm
[62%]
(Computing)
[
Mathematics
] !--This article has been texified automatically ...
Universal algorithm
[62%]
(Computing)
[
Mathematics
] Different formalizations of computability correspond to different refinements of the notion ...
In-crowd algorithm
[62%]
(Computing)
[
Optimization algorithms and methods
] The in-crowd algorithm is a numerical method for solving basis pursuit ...
Approximate counting algorithm
[50%]
(Computing)
[
Randomized algorithms
] The approximate counting algorithm allows the counting of a large number ...
Asymptotically optimal algorithm
[50%]
(Computing)
[
Analysis of algorithms
] Measure of algorithm performance for large inputs ...
Atlantic City algorithm
[50%]
(Computing)
[
Randomized algorithms
] Computer science algorithm ...
Hybrid input-output algorithm
[50%]
(Physics)
[
Diffraction
] Algorithm for phase retrieval ...
Simulated fluorescence process algorithm
[50%]
(Engineering)
[
Fluorescence
] [
Microscopy
] [
Microscopes
] The Simulated Fluorescence Process (SFP) is a computing algorithm used for ...
Baum–Welch algorithm
[50%]
(Computing)
[
Markov models
] [
Bioinformatics algorithms
] [
Randomized algorithms
] Algorithm in mathematics ...
Berlekamp–Massey algorithm
[50%]
(Computing)
[
Error detection and correction
] The Berlekamp–Massey algorithm is an algorithm that will find the shortest ...
Berlekamp–Welch algorithm
[50%]
(Computing)
[
Error detection and correction
] [
Information theory
] [
Coding theory
] Error-correcting algorithm ...
Berlekamp–Zassenhaus algorithm
[50%]
(Computing)
[
Computer algebra
] The worst case of this algorithm is exponential in the number ...
Blahut–Arimoto algorithm
[50%]
(Computing)
[
Coding theory
] Class of algorithms in information theory ...
Brooks–Iyengar algorithm
[50%]
(Computing)
[
Theory of computation
] [
Fault tolerance
] [
Distributed computing problems
] Distributed algorithm for sensor networks ...
Cache-oblivious algorithm
[50%]
(Computing)
[
Analysis of algorithms
] [
Cache (computing)
] [
Models of computation
] I/O-efficient algorithm regardless of cache size ...
Cantor–Zassenhaus algorithm
[50%]
(Computing)
[
Finite fields
] [
Computer algebra
] Algorithm for factoring polynomials over finite fields ...
Fiduccia-Mattheyses algorithm
[50%]
(Engineering)
[
Electronic design automation
] ...
De Boor's algorithm
[50%]
(Computing)
[
Interpolation
] [
Splines (mathematics)
] [
Numerical analysis
] Method of evaluating spline curves ...
De Casteljau's algorithm
[50%]
(Computing)
[
Numerical analysis
] [
Splines (mathematics)
] ...
Diamond-square algorithm
[50%]
(Computing)
[
Computer graphics algorithms
] [
Fractals
] Method for generating heightmaps for computer graphics ...
External memory algorithm
[50%]
(Computing)
[
External memory algorithms
] [
Analysis of algorithms
] [
Cache (computing)
] ...
Faddeev–LeVerrier algorithm
[50%]
(Computing)
[
Homogeneous polynomials
] [
Determinants
] [
Mathematical physics
] Stat. 6 83-84 (1935), J. S. Frame: A simple recursion formula ...
False nearest neighbor algorithm
[50%]
(Computing)
[
Nonlinear time series analysis
] [
Dynamical systems
] [
Statistical algorithms
] The concept was proposed by Kennel et al ...
Fast folding algorithm
[50%]
(Computing)
[
Signal processing
] Method for detecting periodic signals ...
Forward–backward algorithm
[50%]
(Computing)
[
Markov models
] [
Machine learning algorithms
] [
Error detection and correction
] The forward–backward algorithm is an inference algorithm for hidden Markov models ...
Hunt–McIlroy algorithm
[50%]
(Computing)
[
Dynamic programming
] [
Combinatorics
] [
Algorithms on strings
] The k-candidates are marked on the grid ...
Index calculus algorithm
[50%]
(Computing)
[
Group theory
] It requires a factor base as input ...
Itoh–Tsujii inversion algorithm
[50%]
(Computing)
[
Computational number theory
] [
Finite fields
] The Itoh–Tsujii inversion algorithm is used to invert elements in a ...
Kahan summation algorithm
[50%]
(Computing)
[
Numerical analysis
] [
Computer arithmetic
] Algorithm in numerical analysis ...
Karloff–Zwick algorithm
[50%]
(Computing)
[
Randomized algorithms
] [
Approximation algorithms
] The Karloff–Zwick algorithm , in computational complexity theory, is a randomised ...
K-nearest neighbors algorithm
[50%]
(Computing)
[
Nonparametric statistics
] [
Statistical classification
] [
Machine learning algorithms
] Non-parametric classification method ...
Knuth's Simpath algorithm
[50%]
(Computing)
[
Theoretical computer science
] [
Mathematical logic
] [
Graph algorithms
] ...
Krauss matching wildcards algorithm
[50%]
(Computing)
[
Computer science
] [
Algorithms
] ...
Las Vegas algorithm
[50%]
(Computing)
[
Randomized algorithms
] Type of randomized algorithm ...
Minimax approximation algorithm
[50%]
(Computing)
[
Numerical analysis
] ...
Monte Carlo algorithm
[50%]
(Computing)
[
Randomized algorithms
] Type of randomized algorithm ...
Nested sampling algorithm
[50%]
(Computing)
[
Randomized algorithms
] [
Model selection
] [
Bayesian statistics
] The nested sampling algorithm is a computational approach to the Bayesian ...
Output-sensitive algorithm
[50%]
(Computing)
[
Analysis of algorithms
] A property describing run-time complexity of algorithms ...
Package-merge algorithm
[50%]
(Computing)
[
Coding theory
] [
Lossless compression algorithms
] The package-merge algorithm is an O(nL) -time algorithm for finding an ...
P-group generation algorithm
[50%]
(Computing)
[
P-groups
] [
Group theory
] Immediate descendants of step size , of by , resp ...
Searching 1067614 articles took 624 ms
Too many hits. No search in content will be processed.
More results
Error opening file.
<< Previous
Next >>
Back
HandWiki ©