- simulated annealing algorithm
- алгоритм модельной "закалки" (улучшающий свойства модели)
Большой англо-русский и русско-английский словарь. 2001.
simulated annealing algorithm
Смотреть что такое "simulated annealing algorithm" в других словарях:
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
simulated annealing — noun A randomized improvement algorithm, analagous to the metalworking process annealing. For this problem, the simulated annealing based heuristic provides a near optimal solution … Wiktionary
[ECG]; simian adenovirus; simulated annealing [algorithm]; sinoatrial; sinus arrest; sinus arrhythmia; skeletal age; skin-adipose [unit]; sleep apnea; slightly active; slowly adapting [receptor]; soluble in alkaline medium; Spanish American; specific activity; spectrum analysis; sperm abnormality; s — sinoatrial; sinoauricular … Medical dictionary
Adaptive simulated annealing — (ASA) is a variant of simulated annealing (SA) algorithm in which the algorithm parameters that control temperature schedule and random step selection are automatically adjusted according to algorithm progress. This makes the algorithm more… … Wikipedia
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Genetic algorithm — A genetic algorithm (GA) is a search heuristic that mimics the process of natural evolution. This heuristic is routinely used to generate useful solutions to optimization and search problems. Genetic algorithms belong to the larger class of… … Wikipedia
Quantum annealing — In mathematics and applications, quantum annealing (QA) is a general method for finding the global minimum of a given objective function over a given set of candidate solutions (the search space ), by a process analogous to quantum fluctuations.… … Wikipedia
Criss-cross algorithm — This article is about an algorithm for mathematical optimization. For the naming of chemicals, see crisscross method. The criss cross algorithm visits all 8 corners of the Klee–Minty cube in the worst case. It visits 3 additional… … Wikipedia
Expectation-maximization algorithm — An expectation maximization (EM) algorithm is used in statistics for finding maximum likelihood estimates of parameters in probabilistic models, where the model depends on unobserved latent variables. EM alternates between performing an… … Wikipedia
Levenberg–Marquardt algorithm — In mathematics and computing, the Levenberg–Marquardt algorithm (LMA)[1] provides a numerical solution to the problem of minimizing a function, generally nonlinear, over a space of parameters of the function. These minimization problems arise… … Wikipedia
Metropolis–Hastings algorithm — The Proposal distribution Q proposes the next point that the random walk might move to. In mathematics and physics, the Metropolis–Hastings algorithm is a Markov chain Monte Carlo method for obtaining a sequence of random samples from a… … Wikipedia
