program branching - vertaling naar russisch
Diclib.com
Woordenboek ChatGPT
Voer een woord of zin in in een taal naar keuze 👆
Taal:

Vertaling en analyse van woorden door kunstmatige intelligentie ChatGPT

Op deze pagina kunt u een gedetailleerde analyse krijgen van een woord of zin, geproduceerd met behulp van de beste kunstmatige intelligentietechnologie tot nu toe:

  • hoe het woord wordt gebruikt
  • gebruiksfrequentie
  • het wordt vaker gebruikt in mondelinge of schriftelijke toespraken
  • opties voor woordvertaling
  • Gebruiksvoorbeelden (meerdere zinnen met vertaling)
  • etymologie

program branching - vertaling naar russisch

KIND OF STOCHASTIC PROCESS
Branching processes; Branching Process
  • Three cases of ''y'' = ''h''(''z'') intersect with ''y'' = ''z''.

program branching      

общая лексика

ветвление программы

branching program         
  • Boolean operators]].
  • BDD for the function ''ƒ''(''x''<sub>1</sub>, ..., ''x''<sub>8</sub>) = ''x''<sub>1</sub>''x''<sub>2</sub> + ''x''<sub>3</sub>''x''<sub>4</sub> + ''x''<sub>5</sub>''x''<sub>6</sub> + ''x''<sub>7</sub>''x''<sub>8</sub> using bad variable ordering
  • Good variable ordering
  • Diagram of a binary decision diagram represented using complemented edges.
  • BDD for the function ''f''
DATA STRUCTURE
OBDD; Binary Decision Diagram; Binary Decision Diagrams; Binary decision diagrams; Branching programs; Branching program; Ordered binary decision diagram; ROBDD; Reduced ordered binary decision diagram

общая лексика

ветвящаяся программа

computer programme         
  • A symbolic representation of an ALU
  • Computer memory map
  • DEC]] [[VT100]] (1978) was a widely used [[computer terminal]].
  • Switches for manual input on a [[Data General Nova]] 3, manufactured in the mid-1970s
  • Lovelace's description from Note G
  • [["Hello, World!" program]] by [[Brian Kernighan]] (1978)
  • A kernel connects the application software to the hardware of a computer.
  • NOT gate
  • A computer program written in an imperative language
  • hardware]].
  • Artist's depiction of Sacramento State University's Intel 8008 microcomputer (1972)
  • A sample function-level data-flow diagram
  • Fran Bilas]] programmed the [[ENIAC]] by moving cables and setting switches.
  • right
  • Physical memory is scattered around RAM and the hard disk. Virtual memory is one continuous block.
SEQUENCE OF INSTRUCTIONS WRITTEN IN PROGRAMMING LANGUAGE TO PERFORM A SPECIFIED TASK WITH A COMPUTER
Computer programme; Computer code; Computer programs; Software program; Program (programming); Program (computer science); Program (computing); Computer Program; Software code; Program (computer); Computer Programs; Program file; Computer program code; Program module
программа для вычислительной машины, машинная программа

Definitie

computer program

Wikipedia

Branching process

In probability theory, a branching process is a type of mathematical object known as a stochastic process, which consists of collections of random variables. The random variables of a stochastic process are indexed by the natural numbers. The original purpose of branching processes was to serve as a mathematical model of a population in which each individual in generation  n {\displaystyle n} produces some random number of individuals in generation  n + 1 {\displaystyle n+1} , according, in the simplest case, to a fixed probability distribution that does not vary from individual to individual. Branching processes are used to model reproduction; for example, the individuals might correspond to bacteria, each of which generates 0, 1, or 2 offspring with some probability in a single time unit. Branching processes can also be used to model other systems with similar dynamics, e.g., the spread of surnames in genealogy or the propagation of neutrons in a nuclear reactor.

A central question in the theory of branching processes is the probability of ultimate extinction, where no individuals exist after some finite number of generations. Using Wald's equation, it can be shown that starting with one individual in generation zero, the expected size of generation n equals μn where μ is the expected number of children of each individual. If μ < 1, then the expected number of individuals goes rapidly to zero, which implies ultimate extinction with probability 1 by Markov's inequality. Alternatively, if μ > 1, then the probability of ultimate extinction is less than 1 (but not necessarily zero; consider a process where each individual either has 0 or 100 children with equal probability. In that case, μ = 50, but probability of ultimate extinction is greater than 0.5, since that's the probability that the first individual has 0 children). If μ = 1, then ultimate extinction occurs with probability 1 unless each individual always has exactly one child.

In theoretical ecology, the parameter μ of a branching process is called the basic reproductive rate.

Vertaling van &#39program branching&#39 naar Russisch