- lower-bound method
-
метод нижней оценки
Англо-русский словарь терминов металлургии и сварки. 2011.
lower-bound method
Смотреть что такое "lower-bound method" в других словарях:
Method of conditional probabilities — In mathematics and computer science, the probabilistic method is used to prove the existence of mathematical objects with desired combinatorial properties. The proofs are probabilistic they work by showing that a random object, chosen from some… … Wikipedia
Method of exhaustion — This article is about the method of finding the area of a shape using limits. For the method of proof, see Proof by exhaustion. The method of exhaustion (methodus exhaustionibus, or méthode des anciens) is a method of finding the area of a shape… … Wikipedia
Branch and bound — (BB) is a general algorithm for finding optimal solutions of various optimization problems, especially in discrete and combinatorial optimization. It consists of a systematic enumeration of all candidate solutions, where large subsets of… … Wikipedia
Probabilistic method — This article is not about probabilistic algorithms, which give the right answer with high probability but not with certainty, nor about Monte Carlo methods, which are simulations relying on pseudo randomness. The probabilistic method is a… … Wikipedia
Variational method (quantum mechanics) — The variational method is, in quantum mechanics, one way of finding approximations to the lowest energy eigenstate or ground state, and some excited states. The basis for this method is the variational principle. Introduction Suppose we are given … Wikipedia
Chernoff bound — In probability theory, the Chernoff bound, named after Herman Chernoff, gives exponentially decreasing bounds on tail distributions of sums of independent random variables. It is better than the first or second moment based tail bounds such as… … Wikipedia
Second moment method — The second moment method is a technique used in probability theory and analysis to show that a random variable has positive probability to be positive. The method is often quantitative, in that one can often deducea lower bound on the probability … Wikipedia
Quan Yin Method — The term Quan Yin Method was coined in the 1985 by the spiritual teacher, Supreme Master Ching Hai, to describe the type of meditation that she herself practices and teaches. The spelling is an idiosyncratic romanisation of a Chinese term said to … Wikipedia
Memory bound function — Memory bound refers to a situation in which the time to complete a given computational problem is decided primarily by the amount of available memory to hold data. In other words, the limiting factor of solving a given problem is the memory… … Wikipedia
Nelder–Mead method — Nelder–Mead simplex search over the Rosenbrock banana function (above) and Himmelblau s function (below) See simplex algorithm for Dantzig s algorithm for the problem of linear opti … Wikipedia
Finite-difference time-domain method — Finite difference time domain (FDTD) is a popular computational electrodynamics modeling technique. It is considered easy to understand and easy to implement in software. Since it is a time domain method, solutions can cover a wide frequency… … Wikipedia
