wiring algorithm

wiring algorithm
алгоритм прокладки (трассировки) соединений

Англо-русский словарь технических терминов. 2005.

Игры ⚽ Поможем решить контрольную работу

Смотреть что такое "wiring algorithm" в других словарях:

  • Orthogonal frequency-division multiplexing — Passband modulation v · d · e Analog modulation AM · …   Wikipedia

  • Elevator — For other uses, see Elevator (disambiguation). A set of lifts in the lower level of a London Underground station. The arrows indicate each elevator s position and direction of travel …   Wikipedia

  • Hilary Putnam — Infobox Philosopher region = Western Philosophy era = 20th century philosophy color = #B0C4DE name = Hilary Whitehall Putnam birth = July 31, 1926 flagicon|USA|size=20px Chicago, Illinois school tradition = Analytic main interests = Philosophy of …   Wikipedia

  • Routing (electronic design automation) — Routing is a crucial step in the design of integrated circuits. It builds on a preceding step, called placement, which determines the location of each active element of an IC. Routing is then the process of addingall wires needed to properly… …   Wikipedia

  • Enigma machine — Military Enigma machine …   Wikipedia

  • Wire wrap — This article deals with electronics manufacturing and prototyping techniques, see Wire wrap jewellery for the jewellery related topic Wire wrap is a technique for constructing small numbers of complex electronics assemblies. It is an alternative… …   Wikipedia

  • 2-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… …   Wikipedia

  • Biological network inference — Many types of biological networks exist. Few such networks are known in anything approaching their complete structure, even in the simplest bacteria. Still less is known on the parameters governing the behavior of such networks over time, how the …   Wikipedia

  • Priority queue — A priority queue is an abstract data type in computer programming. It is exactly like a regular queue or stack data structure, but additionally, each element is associated with a priority . stack: elements are pulled in last in first out order (e …   Wikipedia

  • Timeline of quantum computing — Timeline of quantum computers1970s* 1970 Stephen Wiesner invents conjugate coding.* 1973 Alexander Holevo publishes a paper showing that n qubits cannot carry more than n classical bits of information (a result known as Holevo s theorem or Holevo …   Wikipedia

  • Neural network — For other uses, see Neural network (disambiguation). Simplified view of a feedforward artificial neural network The term neural network was traditionally used to refer to a network or circuit of biological neurons.[1] The modern usage of the term …   Wikipedia


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

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