probabilistic circuit

probabilistic circuit
мат. вероятностная цепь

Большой англо-русский и русско-английский словарь. 2001.

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

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

  • Quantum circuit — In quantum information theory, a quantum circuit is a model for quantum computation in which a computation is a sequence of reversible transformations on a quantum mechanical analog of an n bit register. This analogous structure is referred to as …   Wikipedia

  • Next-bit test — In cryptography and the theory of computation, the next bit test[1] is a test against pseudo random number generators. We say that a sequence of bits passes the next bit test for at any position i in the sequence, if an attacker knows the i first …   Wikipedia

  • Causality — (but not causation) denotes a necessary relationship between one event (called cause) and another event (called effect) which is the direct consequence (result) of the first. [http://dictionary.reference.com/search?q=Causality x=35 y=25 Random… …   Wikipedia

  • Edward D. Thalmann — Infobox Military Person name= Edward Deforest Thalmann born= birth date|1945|04|03 Death date and age|2004|07|24|1945|04|03 died= placeofbirth= Jersey City, New Jersey placeofdeath= Durham, North Carolina caption= nickname=|allegiance=… …   Wikipedia

  • PP (complexity) — In complexity theory, PP is the class of decision problems solvable by a probabilistic Turing machine in polynomial time, with an error probability of less than 1/2 for all instances. The abbreviation PP refers to probabilistic polynomial time.… …   Wikipedia

  • BPP — In complexity theory, BPP is the class of decision problems solvable by a probabilistic Turing machine in polynomial time, with an error probability of at most 1/3 for all instances. The abbreviation BPP refers to Bounded error, Probabilistic,… …   Wikipedia

  • Computational complexity theory — is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. In this context, a… …   Wikipedia

  • Stanford Smart Memories Project — Advances in VLSI technology now permit multiple processors to reside on a single integrated circuit chip, or IC. Such a processing system is known as a chip multiprocessor, or multi core CPU system. Building on this technology, the Stanford Smart …   Wikipedia

  • Decompression (diving) — Divers decompressing in the water at the end of a dive Decompression in the context of diving derives from the reduction in ambient pressure experienced by the diver during the ascent at the end of a dive or hyperbaric exposure and refers to both …   Wikipedia

  • nuclear reactor — Physics. reactor (def. 4). Also called nuclear pile. [1940 45] * * * Device that can initiate and control a self sustaining series of nuclear fission reactions. Neutrons released in one fission reaction may strike other heavy nuclei, causing them …   Universalium

  • Ant colony optimization algorithms — Ant behavior was the inspiration for the metaheuristic optimization technique. In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be… …   Wikipedia


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

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