|
|
|
|
|
|
|
|
|
Combinatorial circuit
| Глоссарий по вычислительной технике |
Комбинационная схема
|
|
Circuit, английский
- An arrangement of conductors and electrical apparatus connected to a source of electricity supply (see also open circuit).
- The path of electrical flow from a power source through an outlet and back to ground.
- Цепь; схема
- Means of two-way communication between two or more points. 1. in communication systems, an electronic, electrical, or electromagnetic path between two or more points capable of providing a number of channels. 2. electric or electronic part. 3. optical or electrical component that serves a specific function or functions.
- Originally a physical connection that transmits electricity or signals. now also a communication channel that guarantees a fixed transmission capacity.
- Схема
- Round trip,
- Path followed by an electrical current.
- A set of components that form a circular path or route for fluid flow, e.g., to make open-loop geothermal circuits and closed-loop geothermal circuits.
Circuit, английский
Circuit, английский
Circuit, английский
Circuit, латинский
Circuit (specific function), английский
Circuit access points, английский
Circuit algebra, английский
Алгебра схем; схемная алгебра
Circuit analysis, английский
Схемный анализ
Circuit array, английский
Матрица схем; схемная матрица
Circuit binding; divinity binding; divinity stile, английский
Circuit board, английский
Монтажная плата
Circuit breaker, английский
- A switch suitable for opening a circuit automatically as a result of predetermined conditions, such as those of overcurrent or undervoltage or by some form of external control.
- A device which looks like a switch and is usually located inside the electrical breaker panel or circuit breaker box. it is designed to (1) shut of the power to portions or all of the house and (2) to limit the amount of power flowing through a circuit (m
- Автомат защиты сети
- An electric device for opening and closing a circuit, designed to open the circuit automatically upon flow of a predetermined value of abnormally high current; may be repeatedly reclosed and reused as an automatic overcurrent protection device without replacement of any components.
- Автоматический предохранитель; прерыватель цепи; автоматический прерыватель тока; пакетный переключатель
- Adevice used to interrupt an electrical circuit when current flow exceeds a predetermined level.
- An electrical device used to interrupt an electrical supply in the event of excess current flow. can be either magnetically or thermally activated, or a combination of both. can be manually or automatically reset.
- Device for interrupting an electrical circuit when the current exceeds a predetermined value. the device can be reset after the circuit malfunction has been corrected,
Circuit breaker closing, английский
Circuit breaker neutral pole, английский
Circuit breaker openinig, английский
Circuit breaker position data, английский
Circuit breaker unit, английский
Cbu
Circuit breaker., английский
Circuit breakers, английский
Measures instituted by exchanges to stop trading temporarily when the market has fallen by a certain percentage in a specified period. they are intended to prevent a market free fall by permitting buy and sell orders to rebalance.
Circuit capacity, английский
Нагрузочная способность схемы; логическая нагрузочная характеристика схемы
|
Combinatorial division, английский
Комбинационное деление
Combinatorial explosion, английский
- Комбинаторный взрыв
- When a program begins looking at combinations of choices, as in a look-ahead procedure, or a planning problem, the number of possible choices grows as the product of the number of choices for each element in the search. this grows much faster than the number of individual choices, and can lead to an extremely large number of combinations to evaluate, can prevent the program from reaching a solution in a reasonable time. as an example, consider a program that wishes to find the optimal combination of a number of two-level factors. when there is only one factor, there are only two "combinations" to evaluate. when there are five factors, the program needs to consider 25 or 32 combinations, and when there are 10 factors, there are 210 or 1024 combinations. see also: greedy algorithm, look-ahead.
- It occurs when a small increase in the number of elements that can be combined increase the number of combinations to be computed so fast that it quickly reaches computational limits (->bremmermann`s limit). e.g., the number of possible coalitions (partitions of unlike individuals into like parts) among 3 individuals is 5, among 5 individuals it is 52, among 10 individuals it is 115,975 and among 20 individuals it is 51,724,156,235,572, etc.
|
|
|
|
|
|
|
