computational algorithm
121Newell's algorithm — is a 3D computer graphics procedure for elimination of polygon cycles in the depth sorting required in hidden surface removal. It was proposed in 1972 by brothers Martin Newell and Dick Newell, and Tom Sancha, while all three were working at… …
122Buzen's algorithm — is an algorithm related to queueing theory used to calculate the normalization constant G(N) for a closed Jackson network. This constant is used when analyzing these networks, alternatively Mean value analysis can be used to avoid having to… …
123Aryabhata algorithm — is an algorithm to solve indeterminate Diophantine equations and for residue arithmetic. It is first described in the mathematician astronomer Aryabhata s book Aryabhatiya (499).In recent years, it has been used for cryptographic… …
124Sukhotins Algorithm — is a statistical classification algorithm for classifying characters in a text as vowels or consonants. It may also be of use in some of substitution ciphers and has been considered in deciphering the Voynich manuscript, though one problem is to… …
125Apostolico-Giancarlo algorithm — an algorithm which remembers the length of the longest suffix of the pattern ending at the right position of the window at the end of each attempt. These information are stored in a table skip. It was designed by Apostolico and Giancarlo.… …
126Fair Computational tree logic — is conventional computational tree logic studied with explicit fairness constraints.Weak fairness / justiceThis declares conditions such as all processes are executing infinitely often. If you consider the processes to be Pi, then the condition… …
127Minimax approximation algorithm — Polynomial expansions such as the Taylor series expansion are often convenient for theoretical work but less useful for practical applications. For practical work it is often desirable to minimize the maximum absolute or relative error of a… …
128PLATO (computational chemistry) — PLATO (Package for Linear combination of ATomic Orbitals) is a suite of programs designed and written by Andrew Horsfield and Steven Kenny. Capabilities of the program include a tight binding algorithm, and a self consistent field method using… …
