- recomputing
- Перевычисление
Большой англо-русский и русско-английский словарь. 2001.
recomputing
Смотреть что такое "recomputing" в других словарях:
recomputation — n. instance of recomputing, instance of recalculating; result of recomputing, result of recalculating … English contemporary dictionary
recomputations — n. instance of recomputing, instance of recalculating; result of recomputing, result of recalculating … English contemporary dictionary
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Ackermann function — In recursion theory, the Ackermann function or Ackermann Péter function is a simple example of a general recursive function that is not primitive recursive. General recursive functions are also known as computable functions. The set of primitive… … Wikipedia
Checksum — Effect of a typical checksum function (the Unix cksum utility). A checksum or hash sum is a fixed size datum computed from an arbitrary block of digital data for the purpose of detecting accidental errors that may have been introduced during its… … Wikipedia
Functional programming — In computer science, functional programming is a programming paradigm that treats computation as the evaluation of mathematical functions and avoids state and mutable data. It emphasizes the application of functions, in contrast with the… … Wikipedia
Compiler optimization — is the process of tuning the output of a compiler to minimize or maximize some attributes of an executable computer program. The most common requirement is to minimize the time taken to execute a program; a less common one is to minimize the… … Wikipedia
Load balancing (computing) — Load balancing is a computer networking methodology to distribute workload across multiple computers or a computer cluster, network links, central processing units, disk drives, or other resources, to achieve optimal resource utilization,… … Wikipedia
Born-Oppenheimer approximation — In quantum chemistry, the computation of the energy and wavefunction of an average size molecule is a formidable task that is alleviated by the Born Oppenheimer (BO) approximation. For instance the benzene molecule consists of 12 nuclei and 42… … Wikipedia
Dynamic programming — For the programming paradigm, see Dynamic programming language. In mathematics and computer science, dynamic programming is a method for solving complex problems by breaking them down into simpler subproblems. It is applicable to problems… … Wikipedia
Common subexpression elimination — In computer science, common subexpression elimination (CSE) is a compiler optimization that searches for instances of identical expressions (i.e., they all evaluate to the same value), and analyses whether it is worthwhile replacing them with a… … Wikipedia
