# Time-bound processing

﻿
Time-bound processing
Срочная обработка (фотоматериалов).

Краткий толковый словарь по полиграфии. 2010.

### Смотреть что такое "Time-bound processing" в других словарях:

• Bound Brook (New Jersey) — Bound Brook DEC …   Deutsch Wikipedia

• Time complexity — In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the size of the input to the problem. The time complexity of an algorithm is commonly expressed using big O… …   Wikipedia

• meat processing — Introduction       preparation of meat for human consumption.       Meat is the common term used to describe the edible portion of animal tissues and any processed or manufactured products prepared from these tissues. Meats are often classified… …   Universalium

• Memory bound function — Memory bound refers to a situation in which the time to complete a given computational problem is decided primarily by the amount of available memory to hold data. In other words, the limiting factor of solving a given problem is the memory… …   Wikipedia

• Sampling (signal processing) — Signal sampling representation. The continuous signal is represented with a green color whereas the discrete samples are in blue. In signal processing, sampling is the reduction of a continuous signal to a discrete signal. A common example is the …   Wikipedia

• I/O bound — In computer science, I/O bound refers to a condition in which the time it takes to complete a computation is determined principally by the period of time spent waiting for input/output operations to be completed. This is the opposite of a task… …   Wikipedia

• fruit processing — Introduction       preparation of fruit for human consumption.  Fruit is sometimes defined as the product of growth from an angiosperm, or flowering plant. From a purely botanical point of view, the fruit may be only the fleshy growth that arises …   Universalium

• Chernoff bound — In probability theory, the Chernoff bound, named after Herman Chernoff, gives exponentially decreasing bounds on tail distributions of sums of independent random variables. It is better than the first or second moment based tail bounds such as… …   Wikipedia

• Just-in-time compilation — In computing, just in time compilation (JIT), also known as dynamic translation, is a method to improve the runtime performance of computer programs. Historically, computer programs had two modes of runtime operation, either interpreted or static …   Wikipedia

• nickel processing — Introduction       preparation of the metal for use in various products.       Although it is best known for its use in coinage, nickel (Ni) has become much more important for its many industrial applications, which owe their importance to a… …   Universalium

### Поделиться ссылкой на выделенное

##### Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.