- probabilistic solution
- мат. вероятностное решение
Большой англо-русский и русско-английский словарь. 2001.
probabilistic solution
Смотреть что такое "probabilistic solution" в других словарях:
Germano D'Abramo — (born May 25, 1973) is an Italian mathematician and physicist. He currently works at the Istituto di Astrofisica Spaziale e Fisica Cosmica (IASF), Istituto Nazionale di Astrofisica (INAF) in Rome. At the beginning of 2006 he discovered a… … Wikipedia
Number theory — A Lehmer sieve an analog computer once used for finding primes and solving simple diophantine equations. Number theory is a branch of pure mathematics devoted primarily to the study of the integers. Number theorists study prime numbers (the… … Wikipedia
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
Raven paradox — The Raven paradox, also known as Hempel s paradox or Hempel s ravens is a paradox proposed by the German logician Carl Gustav Hempel in the 1940s to illustrate a problem where inductive logic violates intuition. It reveals the problem of… … 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
Simulated annealing — (SA) is a generic probabilistic meta algorithm for the global optimization problem, namely locating a good approximation to the global optimum of a given function in a large search space. It is often used when the search space is discrete (e.g.,… … Wikipedia
Combinatorics — is a branch of mathematics concerning the study of finite or countable discrete structures. Aspects of combinatorics include counting the structures of a given kind and size (enumerative combinatorics), deciding when certain criteria can be met,… … Wikipedia
OptiY — Developer(s) OptiY GmbH Stable release 4.0 / January 12, 2010 Operating system Windows Type Technical computing … 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
Info-gap decision theory — is a non probabilistic decision theory that seeks to optimize robustness to failure – or opportuneness for windfall – under severe uncertainty,[1][2] in particular applying sensitivity analysis of the stability radius type[3] to perturbations in… … Wikipedia
Combinatorial design — theory is the part of combinatorial mathematics that deals with the existence and construction of systems of finite sets whose intersections have specified numerical properties. For instance, a balanced incomplete block design (usually called for … Wikipedia
