-
21 вложенный алгоритм
Большой англо-русский и русско-английский словарь > вложенный алгоритм
-
22 design
1) конструкция; компоновка; проект || конструировать; компоновать; проектировать || проектный2) конструирование; проектирование3) расчёт || рассчитывать || расчётный4) дизайн, художественное конструирование5) чертёж; эскиз, схема•design for environment — проектирование с учётом экологических требований (напр. с минимальными отходами при обработке)
- 3D designdesigned from scratch — проектируемый по эскизу, проектируемый по грубому эскизу (напр. в САПР)
- actual design
- algorithm design
- alternate design
- armless design
- articulated design of drive
- automated design
- bottom-up design
- building block design
- CAD tooling design
- cantilevered design
- cartridge design
- casting design
- closed box design
- computer-aided control system design
- computer-aided design
- computer-aided optimal design
- computer-aided structural design
- computer-aided system design
- computer-assisted design
- concept design
- conceptual design
- control design
- control process design
- custom design
- data-driven design
- detail design
- deterministic design
- double-column design
- dual-purpose design
- dynamic design
- empirical design
- engineering design
- experimental design
- fail-safe design
- feature-based design
- gantry design
- guidepath design
- hard-wired design
- H-bed design
- image design
- industrial design
- integrated mechatronic design
- kingpost design
- layout design
- long-taper design
- mechanical design
- mechatronic design
- modular design
- modular robotic sensor design
- MRAC design
- NC machine design
- nested design
- object-oriented design
- optimal design
- optimum design
- overlapping tooth design
- pallet-forward design
- PERL design
- preliminary design
- process design
- product design
- production design
- program design
- programmable design
- quill design
- rational design
- release design
- revise design
- revised design
- ring bridge design
- safe design
- safety design
- schematic design
- short-tape design
- sliding-head/fixed-spindle design
- static design
- statistical design
- styling design
- supportive design
- system design
- T-bed design
- thermally symmetric design
- thermally symmetrical design
- through-tool coolant design
- tooling design
- tooth form design
- transient design
- tried-and-true design
- two-board design
- unitized design
- VLSI design
- welding design
- wrap-around way designEnglish-Russian dictionary of mechanical engineering and automation > design
-
23 sort
1) сортировка [данных], упорядочиваниеизменение очерёдности (порядка) следования элементов данных (например, строк таблицы или записей БД) в соответствии с некоторым заданным правилом, признаком или группой признаков; обычно по возрастанию или убыванию значений ключевых полейсм. тж. ascending sort, automatic sorting, bubble sort, collating sort, descending sort, external sort, insertion sort, internal sort, lexicographic sort, merge sort, multilevel sort, multipass sort, nested sort, sort algorithm, sort key, sort order, transposition2) вид, тип, класс3) сортировать, упорядочиватьАнгло-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > sort
- 1
- 2
См. также в других словарях:
Nested function — definitions can be compared to how a Matryoshka doll nests within larger versions of itself, in several levels. In computer programming, a nested function (or nested procedure/subroutine) is a function which is lexically (textually) encapsulated… … Wikipedia
Nested sampling algorithm — The nested sampling algorithm is a computational approach to the problem of comparing models in Bayesian statistics, developed in 2004 by physicist John Skilling.[1] Contents 1 Background 2 Applications 3 … Wikipedia
Nested radical — In algebra, a nested radical is a radical expression that contains another radical expression. Examples include: which arises in discussing the regular pentagon; or more complicated ones such as: Contents … Wikipedia
Nested loop join — A nested loop join is a naive algorithm that joins two relations R and S by making two nested loops: For each tuple r in R do For each tuple s in S do If r and s satisfy the join condition Then output the tuple <r,s> This algorithm will… … Wikipedia
Nested dissection — In numerical analysis, nested dissection is a divide and conquer heuristic for the solution of sparse symmetric systems of linear equations based on graph partitioning. Nested dissection was introduced by George (1973); the name was suggested by… … Wikipedia
Block nested loop — A block nested loop is an algorithm used to join two relations in a relational database.This algorithm is a variation on the simple nested loop join used to join two relations R and S (the outer and inner join operands, respectively). Suppose |R| … Wikipedia
Prime-factor FFT algorithm — The Prime factor algorithm (PFA), also called the Good Thomas algorithm (1958/1963), is a fast Fourier transform (FFT) algorithm that re expresses the discrete Fourier transform (DFT) of a size N = N 1 N 2 as a two dimensional N 1 times; N 2 DFT … Wikipedia
Criss-cross algorithm — This article is about an algorithm for mathematical optimization. For the naming of chemicals, see crisscross method. The criss cross algorithm visits all 8 corners of the Klee–Minty cube in the worst case. It visits 3 additional… … Wikipedia
Divide and conquer algorithm — In computer science, divide and conquer (D C) is an important algorithm design paradigm based on multi branched recursion. A divide and conquer algorithm works by recursively breaking down a problem into two or more sub problems of the same (or… … Wikipedia
Levenberg–Marquardt algorithm — In mathematics and computing, the Levenberg–Marquardt algorithm (LMA)[1] provides a numerical solution to the problem of minimizing a function, generally nonlinear, over a space of parameters of the function. These minimization problems arise… … Wikipedia
Nearest-neighbor chain algorithm — In the theory of cluster analysis, the nearest neighbor chain algorithm is a method that can be used to perform several types of agglomerative hierarchical clustering, using an amount of memory that is linear in the number of points to be… … Wikipedia
