-
21 strength reduction
уменьшение сложности; снижение стоимости выполненияреализуемый в компиляторах метод оптимизации, предусматривающий разложение сложных команд и/или замену дорогих (по затратам времени) операций более дешёвыми, которые дают идентичные результаты. Например, функция с некоторой систематически изменяющейся переменной вычисляется более эффективно при использовании предыдущих значений этой функции; а в Фортране операцию Х**2 можно автоматически заменить на Х*Х. В процедурном ЯВУ этот метод может применяться к выражению, содержащему переменную цикла, а в декларативном языке - к аргументу рекурсивной функцииАнгло-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > strength reduction
-
22 technique
- 1
- 2
См. также в других словарях:
Recursive descent parser — A recursive descent parser is a top down parser built from a set of mutually recursive procedures (or a non recursive equivalent) where each such procedure usually implements one of the production rules of the grammar. Thus the structure of the… … Wikipedia
Programming paradigm — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concu … Wikipedia
Programming in the large and programming in the small — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computin … Wikipedia
Recursive Bayesian estimation — is a general probabilistic approach for estimating an unknown probability density function recursively over time using incoming measurements and a mathematical process model. Model The true state x is assumed to be an unobserved Markov process,… … Wikipedia
Recursive function — may refer to: Recursion (computer science), a procedure or subroutine, implemented in a programming language, whose implementation references itself A total computable function, a function which is defined for all possible inputs See also μ… … Wikipedia
Recursive type — In computer programming languages, a recursive type is a data type for values that may contain other values of the same type.An example is the list type, in Haskell: data List a = Nil | Cons a (List a) This indicates that a list of a s is either… … Wikipedia
Recursive definition — A recursive definition or inductive definition is one that defines something in terms of itself (that is, recursively), albeit in a useful way. For it to work, the definition in any given case must be well founded, avoiding an infinite regress.… … Wikipedia
Recursive transition network — A recursive transition network ( RTN ) is a graph theoretical schematic used to represent the rules of a context free grammar. RTNs have application to programming languages, natural language and lexical analysis. Any sentence that is constructed … Wikipedia
Flow-based programming — In computer science, flow based programming (FBP) is a programming paradigm that defines applications as networks of black box processes, which exchange data across predefined connections by message passing. These black box processes can be… … Wikipedia
Constraint logic programming — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computing … Wikipedia
Non-structured programming — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computing … Wikipedia