-
1 Lee algorithm
Алгоритм Лі, хвильовий алгоритм побудови топологіїEnglish-Ukrainian dictionary of microelectronics > Lee algorithm
-
2 modified Lee algorithm
модифікований алгоритм Лі (різновид хвильового алгоритму побудови топології)English-Ukrainian dictionary of microelectronics > modified Lee algorithm
-
3 algorithm
- aim algorithm
- automatic placement and routing algorithm
- backward error recovery algorithm
- best path algorithm
- bit-map oriented spatial processing algorithm
- block-oriented algorithm
- branch and bound algorithm
- channel algorithm
- D algorithm
- deductive algorithm
- discard algorithm
- exact embedding algorithm
- expansion algorithm
- fast-Fourier-transform algorithm
- graph-based algorithm
- Gummel’s algorithm
- hidden-line algorithm
- image processing algorithm
- iterative algorithm
- Lee algorithm
- min-cut algorithm
- modified Lee algorithm
- N-step algorithm
- one-direction algorithm
- pessimistic simulation algorithm
- random-search algorithm
- repair-most algorithm
- Roth’s D algorithm
- routing algorithm
- Schonhage algorithm
- selective-trace algorithm
- sequential algorithm
- stable sorting algorithm
- star algorithm
- table-driven algorithm
- 9-value D- algorithm
- wiring algorithmEnglish-Ukrainian dictionary of microelectronics > algorithm
См. также в других словарях:
Lee algorithm — The Lee algorithm is one possible solution for maze routing problems.1) Initialisation Select start point, mark with 0 i := 02) Wave expansion REPEAT Mark all unlabeled neighbors of points marked with i with i+1 i := i+1 UNTIL ((target reached)… … Wikipedia
Lee Killough (programmer) — Lee Killough is an American programmer who has contributed to the development of source ports for the computer game Doom . He was part of the Boom team and is the author of Marine s Best Friend.Lee Killough notably added many performance… … Wikipedia
CYK algorithm — The Cocke–Younger–Kasami (CYK) algorithm (alternatively called CKY) is a parsing algorithm for context free grammars. It employs bottom up parsing and dynamic programming. The standard version of CYK operates only on context free grammars given… … Wikipedia
Nicholl–Lee–Nicholl — The Nicholl Lee Nicholl algorithm is a fast line clipping algorithm that reduces the chances of clipping a single line segment multiple times, as may happen in the Cohen Sutherland algorithm. Description Using the Nicholl–Lee–Nicholl algorithm,… … Wikipedia
De Boor's algorithm — In the mathematical subfield of numerical analysis the de Boor s algorithm is a fast and numerically stable algorithm for evaluating spline curves in B spline form. It is a generalization of the de Casteljau s algorithm for Bézier curves. The… … Wikipedia
Tiny Encryption Algorithm — TEA Zwei Feistel Runden (ein Zyklus) von TEA Entwickler Roger Needham, David Wheeler Veröffentlicht 1994 Schlüssellänge … Deutsch Wikipedia
Tiny Encryption Algorithm — En criptografía, el Tiny Encryption Algorithm (TEA) (Algoritmo Diminuto de Cifrado) es un algoritmo para el cifrado por bloques notable por su simplicidad de descripción e implementación (generalmente unas pocas líneas de código). Fue diseñado… … Wikipedia Español
Page replacement algorithm — This article is about algorithms specific to paging. For outline of general cache algorithms (e.g. processor, disk, database, web), see Cache algorithms. In a computer operating system that uses paging for virtual memory management, page… … Wikipedia
Constraint algorithm — In mechanics, a constraint algorithm is a method for satisfying constraints for bodies that obey Newton s equations of motion. There are three basic approaches to satisfying such constraints: choosing novel unconstrained coordinates ( internal… … Wikipedia
Bees algorithm — The Bees Algorithm is a population based search algorithm first developed in 2005. [Pham DT, Ghanbarzadeh A, Koc E, Otri S, Rahim S and Zaidi M. The Bees Algorithm. Technical Note, Manufacturing Engineering Centre, Cardiff University, UK, 2005]… … Wikipedia
Frank–Wolfe algorithm — The Frank–Wolfe algorithm, also known as the convex combination algorithm , is a classic algorithm in operations research (OR). It was originally proposed by Marguerite Frank and Phil Wolfe in 1956 as a procedure for solving quadratic programming … Wikipedia