maximin algorithm - перевод на русский
Diclib.com
Словарь ChatGPT
Поиск в словаре Индивидуальные решения
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология
  1. Словари
  2. Англо-русский словарь
  3. maximin algorithm

maximin algorithm - перевод на русский

DECISION RULE USED IN ARTIFICIAL INTELLIGENCE, DECISION THEORY, GAME THEORY, STATISTICS AND PHILOSOPHY FOR MINIMIZING THE POSSIBLE LOSS FOR A WORST CASE (MAXIMUM LOSS) SCENARIO
Minimax algorithm; Minimax test; Maximin principle; Maximin criterion; Minmax; Maximin (decision theory); Bottleneck programming; Minimax strategy; Game value; Maximin (philosophy); Minimax principle; Maxmin; MiniMax; Minimax Strategy; Minimax solution; Minmax algorithm; Maximin Principle
  • An animated pedagogical example that attempts to be human-friendly by substituting initial infinite (or arbitrarily large) values for emptiness and by avoiding using the [[negamax]] coding simplifications.
Найдено результатов: 522
maximin algorithm      

математика

максиминный алгоритм

maximin algorithm      
максиминный алгоритм
algorithm         
  • Alan Turing's statue at [[Bletchley Park]]
  • The example-diagram of Euclid's algorithm from T.L. Heath (1908), with more detail added. Euclid does not go beyond a third measuring and gives no numerical examples. Nicomachus gives the example of 49 and 21: "I subtract the less from the greater; 28 is left; then again I subtract from this the same 21 (for this is possible); 7 is left; I subtract this from 21, 14 is left; from which I again subtract 7 (for this is possible); 7 is left, but 7 cannot be subtracted from 7." Heath comments that "The last phrase is curious, but the meaning of it is obvious enough, as also the meaning of the phrase about ending 'at one and the same number'."(Heath 1908:300).
  • "Inelegant" is a translation of Knuth's version of the algorithm with a subtraction-based remainder-loop replacing his use of division (or a "modulus" instruction). Derived from Knuth 1973:2–4. Depending on the two numbers "Inelegant" may compute the g.c.d. in fewer steps than "Elegant".
  • 1=IF test THEN GOTO step xxx}}, shown as diamond), the unconditional GOTO (rectangle), various assignment operators (rectangle), and HALT (rectangle). Nesting of these structures inside assignment-blocks results in complex diagrams (cf. Tausworthe 1977:100, 114).
  • A graphical expression of Euclid's algorithm to find the greatest common divisor for 1599 and 650 <syntaxhighlight lang="text" highlight="1,5"> 1599 = 650×2 + 299 650 = 299×2 + 52 299 = 52×5 + 39 52 = 39×1 + 13 39 = 13×3 + 0</syntaxhighlight>
SEQUENCE OF INSTRUCTIONS TO PERFORM A TASK
Algorithmically; Computer algorithm; Properties of algorithms; Algorithim; Algoritmi de Numero Indorum; Algoritmi de numero indorum; Algoritmi De Numero Indorum; Алгоритм; Algorithem; Software logic; Computer algorithms; Encoding Algorithm; Naive algorithm; Naïve algorithm; Algorithm design; Algorithm segment; Algorithmic problem; Algorythm; Rule set; Continuous algorithm; Algorithms; Software-based; Algorithmic method; Algorhthym; Algorthym; Algorhythms; Formalization of algorithms; Mathematical algorithm; Draft:GE8151 Problem Solving and Python Programming; Computational algorithms; Optimization algorithms; Algorithm classification; History of algorithms; Patented algorithms; Algorithmus
algorithm noun math. алгоритм algorithm validation - проверка правильности алгоритма
algorithmic method         
  • Alan Turing's statue at [[Bletchley Park]]
  • The example-diagram of Euclid's algorithm from T.L. Heath (1908), with more detail added. Euclid does not go beyond a third measuring and gives no numerical examples. Nicomachus gives the example of 49 and 21: "I subtract the less from the greater; 28 is left; then again I subtract from this the same 21 (for this is possible); 7 is left; I subtract this from 21, 14 is left; from which I again subtract 7 (for this is possible); 7 is left, but 7 cannot be subtracted from 7." Heath comments that "The last phrase is curious, but the meaning of it is obvious enough, as also the meaning of the phrase about ending 'at one and the same number'."(Heath 1908:300).
  • "Inelegant" is a translation of Knuth's version of the algorithm with a subtraction-based remainder-loop replacing his use of division (or a "modulus" instruction). Derived from Knuth 1973:2–4. Depending on the two numbers "Inelegant" may compute the g.c.d. in fewer steps than "Elegant".
  • 1=IF test THEN GOTO step xxx}}, shown as diamond), the unconditional GOTO (rectangle), various assignment operators (rectangle), and HALT (rectangle). Nesting of these structures inside assignment-blocks results in complex diagrams (cf. Tausworthe 1977:100, 114).
  • A graphical expression of Euclid's algorithm to find the greatest common divisor for 1599 and 650 <syntaxhighlight lang="text" highlight="1,5"> 1599 = 650×2 + 299 650 = 299×2 + 52 299 = 52×5 + 39 52 = 39×1 + 13 39 = 13×3 + 0</syntaxhighlight>
SEQUENCE OF INSTRUCTIONS TO PERFORM A TASK
Algorithmically; Computer algorithm; Properties of algorithms; Algorithim; Algoritmi de Numero Indorum; Algoritmi de numero indorum; Algoritmi De Numero Indorum; Алгоритм; Algorithem; Software logic; Computer algorithms; Encoding Algorithm; Naive algorithm; Naïve algorithm; Algorithm design; Algorithm segment; Algorithmic problem; Algorythm; Rule set; Continuous algorithm; Algorithms; Software-based; Algorithmic method; Algorhthym; Algorthym; Algorhythms; Formalization of algorithms; Mathematical algorithm; Draft:GE8151 Problem Solving and Python Programming; Computational algorithms; Optimization algorithms; Algorithm classification; History of algorithms; Patented algorithms; Algorithmus

математика

алгоритмический метод

Euclidean algorithm         
  • A 24-by-60 rectangle is covered with ten 12-by-12 square tiles, where 12 is the GCD of 24 and 60. More generally, an ''a''-by-''b'' rectangle can be covered with square tiles of side-length ''c'' only if ''c'' is a common divisor of ''a'' and ''b''.
  • Plot of a linear [[Diophantine equation]], 9''x''&nbsp;+&nbsp;12''y''&nbsp;=&nbsp;483. The solutions are shown as blue circles.
  • cube root of 1]].
  • Subtraction-based animation of the Euclidean algorithm. The initial rectangle has dimensions ''a''&nbsp;=&nbsp;1071 and ''b''&nbsp;=&nbsp;462. Squares of size 462&times;462 are placed within it leaving a 462&times;147 rectangle. This rectangle is tiled with 147&times;147 squares until a 21&times;147 rectangle is left, which in turn is tiled with 21&times;21 squares, leaving no uncovered area. The smallest square size, 21, is the GCD of 1071 and 462.
  • compass]] in a painting of about 1474.
  • ''u''<sup>2</sup> + ''v''<sup>2</sup>}} less than 500
ALGORITHM FOR COMPUTING GREATEST COMMON DIVISORS
Euclids algorithm; Euclidean Algorithm; Euclid's algorithm; Euclid's algorithem; Euclid algorithm; The Euclidean Algorithm; Game of Euclid; Euclid’s Algorithm; Euclid's division algorithm; Generalizations of the Euclidean algorithm; Applications of the Euclidean algorithm
алгоритм Евклида (для нахождения общего наибольшего делителя)
algorithm         
  • Alan Turing's statue at [[Bletchley Park]]
  • The example-diagram of Euclid's algorithm from T.L. Heath (1908), with more detail added. Euclid does not go beyond a third measuring and gives no numerical examples. Nicomachus gives the example of 49 and 21: "I subtract the less from the greater; 28 is left; then again I subtract from this the same 21 (for this is possible); 7 is left; I subtract this from 21, 14 is left; from which I again subtract 7 (for this is possible); 7 is left, but 7 cannot be subtracted from 7." Heath comments that "The last phrase is curious, but the meaning of it is obvious enough, as also the meaning of the phrase about ending 'at one and the same number'."(Heath 1908:300).
  • "Inelegant" is a translation of Knuth's version of the algorithm with a subtraction-based remainder-loop replacing his use of division (or a "modulus" instruction). Derived from Knuth 1973:2–4. Depending on the two numbers "Inelegant" may compute the g.c.d. in fewer steps than "Elegant".
  • 1=IF test THEN GOTO step xxx}}, shown as diamond), the unconditional GOTO (rectangle), various assignment operators (rectangle), and HALT (rectangle). Nesting of these structures inside assignment-blocks results in complex diagrams (cf. Tausworthe 1977:100, 114).
  • A graphical expression of Euclid's algorithm to find the greatest common divisor for 1599 and 650 <syntaxhighlight lang="text" highlight="1,5"> 1599 = 650×2 + 299 650 = 299×2 + 52 299 = 52×5 + 39 52 = 39×1 + 13 39 = 13×3 + 0</syntaxhighlight>
SEQUENCE OF INSTRUCTIONS TO PERFORM A TASK
Algorithmically; Computer algorithm; Properties of algorithms; Algorithim; Algoritmi de Numero Indorum; Algoritmi de numero indorum; Algoritmi De Numero Indorum; Алгоритм; Algorithem; Software logic; Computer algorithms; Encoding Algorithm; Naive algorithm; Naïve algorithm; Algorithm design; Algorithm segment; Algorithmic problem; Algorythm; Rule set; Continuous algorithm; Algorithms; Software-based; Algorithmic method; Algorhthym; Algorthym; Algorhythms; Formalization of algorithms; Mathematical algorithm; Draft:GE8151 Problem Solving and Python Programming; Computational algorithms; Optimization algorithms; Algorithm classification; History of algorithms; Patented algorithms; Algorithmus

['ælgərið(ə)m]

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

алгоритм

математическая функция или конечный набор описаний конкретной последовательности действий (правил), необходимых для того, чтобы компьютер или интеллектуальное устройство выполнили за конечное время некоторую задачу, сжатие изображения, выбор оптимального маршрута пересылки пакета или шифрование данных. Алгоритм может быть описан блок-схемой. Термин происходит от имени древнеперсидского математика Мухаммеда ибн Муса аль Харезми, написавшего трактат, посвященный алгоритмическому методу

метод, правило

синоним

ALG

существительное

специальный термин

алгоритм

Euclid's algorithm         
  • A 24-by-60 rectangle is covered with ten 12-by-12 square tiles, where 12 is the GCD of 24 and 60. More generally, an ''a''-by-''b'' rectangle can be covered with square tiles of side-length ''c'' only if ''c'' is a common divisor of ''a'' and ''b''.
  • Plot of a linear [[Diophantine equation]], 9''x''&nbsp;+&nbsp;12''y''&nbsp;=&nbsp;483. The solutions are shown as blue circles.
  • cube root of 1]].
  • Subtraction-based animation of the Euclidean algorithm. The initial rectangle has dimensions ''a''&nbsp;=&nbsp;1071 and ''b''&nbsp;=&nbsp;462. Squares of size 462&times;462 are placed within it leaving a 462&times;147 rectangle. This rectangle is tiled with 147&times;147 squares until a 21&times;147 rectangle is left, which in turn is tiled with 21&times;21 squares, leaving no uncovered area. The smallest square size, 21, is the GCD of 1071 and 462.
  • compass]] in a painting of about 1474.
  • ''u''<sup>2</sup> + ''v''<sup>2</sup>}} less than 500
ALGORITHM FOR COMPUTING GREATEST COMMON DIVISORS
Euclids algorithm; Euclidean Algorithm; Euclid's algorithm; Euclid's algorithem; Euclid algorithm; The Euclidean Algorithm; Game of Euclid; Euclid’s Algorithm; Euclid's division algorithm; Generalizations of the Euclidean algorithm; Applications of the Euclidean algorithm
алгоритм Евклида (для нахождения общего наибольшего делителя)
algorithm         
  • Alan Turing's statue at [[Bletchley Park]]
  • The example-diagram of Euclid's algorithm from T.L. Heath (1908), with more detail added. Euclid does not go beyond a third measuring and gives no numerical examples. Nicomachus gives the example of 49 and 21: "I subtract the less from the greater; 28 is left; then again I subtract from this the same 21 (for this is possible); 7 is left; I subtract this from 21, 14 is left; from which I again subtract 7 (for this is possible); 7 is left, but 7 cannot be subtracted from 7." Heath comments that "The last phrase is curious, but the meaning of it is obvious enough, as also the meaning of the phrase about ending 'at one and the same number'."(Heath 1908:300).
  • "Inelegant" is a translation of Knuth's version of the algorithm with a subtraction-based remainder-loop replacing his use of division (or a "modulus" instruction). Derived from Knuth 1973:2–4. Depending on the two numbers "Inelegant" may compute the g.c.d. in fewer steps than "Elegant".
  • 1=IF test THEN GOTO step xxx}}, shown as diamond), the unconditional GOTO (rectangle), various assignment operators (rectangle), and HALT (rectangle). Nesting of these structures inside assignment-blocks results in complex diagrams (cf. Tausworthe 1977:100, 114).
  • A graphical expression of Euclid's algorithm to find the greatest common divisor for 1599 and 650 <syntaxhighlight lang="text" highlight="1,5"> 1599 = 650×2 + 299 650 = 299×2 + 52 299 = 52×5 + 39 52 = 39×1 + 13 39 = 13×3 + 0</syntaxhighlight>
SEQUENCE OF INSTRUCTIONS TO PERFORM A TASK
Algorithmically; Computer algorithm; Properties of algorithms; Algorithim; Algoritmi de Numero Indorum; Algoritmi de numero indorum; Algoritmi De Numero Indorum; Алгоритм; Algorithem; Software logic; Computer algorithms; Encoding Algorithm; Naive algorithm; Naïve algorithm; Algorithm design; Algorithm segment; Algorithmic problem; Algorythm; Rule set; Continuous algorithm; Algorithms; Software-based; Algorithmic method; Algorhthym; Algorthym; Algorhythms; Formalization of algorithms; Mathematical algorithm; Draft:GE8151 Problem Solving and Python Programming; Computational algorithms; Optimization algorithms; Algorithm classification; History of algorithms; Patented algorithms; Algorithmus
алгоритм (cryptoalgorithm) криптографический алгоритм, криптоалгоритм; алгоритм шифрования (криптографического закрытия) - abstract algorithm
- access algorithm
- anti-virus algorithm
- approximate algorithm
- assymetric algorithm
- audio scrambling algorithm
- authentication algorithm
- B-Crypt algorithm
- block cipher algorithm
- block-encryption algorithm
- bit sequence generating algorithm
- breaking algorithm
- cipher algorithm
- ciphering algorithm
- classified algorithm
- code-breaking algorithm
- coding algorithm
- collision resolution algorithm
- combinaforial algorithm
- compression algorithm
- confidentiality algorithm
- correlation algorithm
- crypt algorithm
- cryption algorithm
- cryptoanalytic algorithm
- cryptographic algorithm
- data authentication algorithm
- data encryption algorithm
- data reduction algorithm
- DEA algorithm
- decoding algorithm
- DES algorithm
- deterministic algorithm
- dichotomic algorithm
- digital encryption algorithm
- digital signature algorithm
- double-key algorithm
- double transposition algorithm
- dual key algorithm
- e-d algorithm
- encryption algorithm
- encryption-decryption algorithm
- error correction algorithm
- Euclidean algorithm
- Euclid's algorithm
- exponential time algorithm
- exponentiation algorithm
- factoring algorithm
- factorization algorithm
- fast data encryption algorithm
- FEAL algorithm
- fixed algorithm
- Fourier transform algorithm
- handshaking algorithm
- hashing algorithm
- heuristic algorithm
- international encryption algorithm
- key-controlled algorithm
- key-dependent algorithm
- key distribution algorithm
- key generation algorithm
- key input algorithm
- keyed algorithm
- key exchange algorithm
- key expansion algorithm
- key management algorithm
- key shedule algorithm
- key stream algorithm
- knapsack algorithm
- linear predictive coding algorithm
- linear sieve algorithm
- meet-in-the-middle algorithm
- message authentification algorithm
- message digest algorithm
- modification defection encryption algorithm
- modular algorithm
- modular multiplication algorithm
- non-linear algorithm
- one-way encryption algorithm
- password algorithm
- password cracking algorithm
- password encryption algorithm
- password generation algorithm
- permutation algorithm
- polynomial algorithm
- polynomial time algorithm
- predicting algorithm
- prediction algorithm
- primality testing algorithm
- private cryptographic algorithm
- probabilistic algorithm
- proprietary encryption algorithm
- protection algorithm
- protection mechanism algorithm
- p-time algorithm
- public key algorithm
- quadratic sieve factoring algorithm
- Rivest-Shamir-Adleman algorithm
- public transformation algorithm
- quaternary DES algorithm
- randomizing algorithm
- recognition algorithm
- recursive algorithm
- routing algorithm
- RSA algorithm
- RSA B safe algorithm
- scrambling algorithm
- search algorithm
- secret key algorithm
- secret transformation algorithm
- SEEK algorithm
- secure exchange of keys algorithm
- shortest path algorithm
- sieve algorithm
- signal processing algorithm
- signal reconstruction algorithm
- signature algorithm
- single-key algorithm
- solving algorithm
- standard encryption algorithm
- standardized encryption algorithm
- stream cipher algorithm
- strong algorithm
- substitution algorithm
- substitution-permutation encryption algorithm
- transformational algorithm
- unbreakable algorithm
- user-modified algorithm
- verification algorithm
- Vitterbi algorithm
- vocoding algorithm
- voice-digitising algorithm
- voice encoding algorithm
encoding algorithm         
  • Alan Turing's statue at [[Bletchley Park]]
  • The example-diagram of Euclid's algorithm from T.L. Heath (1908), with more detail added. Euclid does not go beyond a third measuring and gives no numerical examples. Nicomachus gives the example of 49 and 21: "I subtract the less from the greater; 28 is left; then again I subtract from this the same 21 (for this is possible); 7 is left; I subtract this from 21, 14 is left; from which I again subtract 7 (for this is possible); 7 is left, but 7 cannot be subtracted from 7." Heath comments that "The last phrase is curious, but the meaning of it is obvious enough, as also the meaning of the phrase about ending 'at one and the same number'."(Heath 1908:300).
  • "Inelegant" is a translation of Knuth's version of the algorithm with a subtraction-based remainder-loop replacing his use of division (or a "modulus" instruction). Derived from Knuth 1973:2–4. Depending on the two numbers "Inelegant" may compute the g.c.d. in fewer steps than "Elegant".
  • 1=IF test THEN GOTO step xxx}}, shown as diamond), the unconditional GOTO (rectangle), various assignment operators (rectangle), and HALT (rectangle). Nesting of these structures inside assignment-blocks results in complex diagrams (cf. Tausworthe 1977:100, 114).
  • A graphical expression of Euclid's algorithm to find the greatest common divisor for 1599 and 650 <syntaxhighlight lang="text" highlight="1,5"> 1599 = 650×2 + 299 650 = 299×2 + 52 299 = 52×5 + 39 52 = 39×1 + 13 39 = 13×3 + 0</syntaxhighlight>
SEQUENCE OF INSTRUCTIONS TO PERFORM A TASK
Algorithmically; Computer algorithm; Properties of algorithms; Algorithim; Algoritmi de Numero Indorum; Algoritmi de numero indorum; Algoritmi De Numero Indorum; Алгоритм; Algorithem; Software logic; Computer algorithms; Encoding Algorithm; Naive algorithm; Naïve algorithm; Algorithm design; Algorithm segment; Algorithmic problem; Algorythm; Rule set; Continuous algorithm; Algorithms; Software-based; Algorithmic method; Algorhthym; Algorthym; Algorhythms; Formalization of algorithms; Mathematical algorithm; Draft:GE8151 Problem Solving and Python Programming; Computational algorithms; Optimization algorithms; Algorithm classification; History of algorithms; Patented algorithms; Algorithmus

математика

алгоритм кодирования

кодирующий алгоритм

algorithm         
  • Alan Turing's statue at [[Bletchley Park]]
  • The example-diagram of Euclid's algorithm from T.L. Heath (1908), with more detail added. Euclid does not go beyond a third measuring and gives no numerical examples. Nicomachus gives the example of 49 and 21: "I subtract the less from the greater; 28 is left; then again I subtract from this the same 21 (for this is possible); 7 is left; I subtract this from 21, 14 is left; from which I again subtract 7 (for this is possible); 7 is left, but 7 cannot be subtracted from 7." Heath comments that "The last phrase is curious, but the meaning of it is obvious enough, as also the meaning of the phrase about ending 'at one and the same number'."(Heath 1908:300).
  • "Inelegant" is a translation of Knuth's version of the algorithm with a subtraction-based remainder-loop replacing his use of division (or a "modulus" instruction). Derived from Knuth 1973:2–4. Depending on the two numbers "Inelegant" may compute the g.c.d. in fewer steps than "Elegant".
  • 1=IF test THEN GOTO step xxx}}, shown as diamond), the unconditional GOTO (rectangle), various assignment operators (rectangle), and HALT (rectangle). Nesting of these structures inside assignment-blocks results in complex diagrams (cf. Tausworthe 1977:100, 114).
  • A graphical expression of Euclid's algorithm to find the greatest common divisor for 1599 and 650 <syntaxhighlight lang="text" highlight="1,5"> 1599 = 650×2 + 299 650 = 299×2 + 52 299 = 52×5 + 39 52 = 39×1 + 13 39 = 13×3 + 0</syntaxhighlight>
SEQUENCE OF INSTRUCTIONS TO PERFORM A TASK
Algorithmically; Computer algorithm; Properties of algorithms; Algorithim; Algoritmi de Numero Indorum; Algoritmi de numero indorum; Algoritmi De Numero Indorum; Алгоритм; Algorithem; Software logic; Computer algorithms; Encoding Algorithm; Naive algorithm; Naïve algorithm; Algorithm design; Algorithm segment; Algorithmic problem; Algorythm; Rule set; Continuous algorithm; Algorithms; Software-based; Algorithmic method; Algorhthym; Algorthym; Algorhythms; Formalization of algorithms; Mathematical algorithm; Draft:GE8151 Problem Solving and Python Programming; Computational algorithms; Optimization algorithms; Algorithm classification; History of algorithms; Patented algorithms; Algorithmus
алгоритм
- almost-dual algorithm
 - approximation algorithm
 - best-route algorithm
 - composite simplex algorithm
 - control algorithm
 - decomposition algorithm
 - dual algorithm
 - dual simplex algorithm
 - estimation algorithm
 - maximin algorithm
 - minimax algorithm
 - network algorithm
 - operative algorithm
 - optimal path algorithm
 - optimization algorithm
 - prediction algorithm
 - primal algorithm
 - primal-dual algorithm
 - search algorithm
 - shortest route algorithm
 - transportation algorithm
 - verification algorithm

Википедия

Minimax

Minimax (sometimes MinMax, MM or saddle point) is a decision rule used in artificial intelligence, decision theory, game theory, statistics, and philosophy for minimizing the possible loss for a worst case (maximum loss) scenario. When dealing with gains, it is referred to as "maximin" – to maximize the minimum gain. Originally formulated for several-player zero-sum game theory, covering both the cases where players take alternate moves and those where they make simultaneous moves, it has also been extended to more complex games and to general decision-making in the presence of uncertainty.

https://en.wikipedia.org/wiki/Minimax
Как переводится maximin algorithm на Русский язык
Поиск в словаре
Все словари Английский словарь Англо-арабский словарь Англо-голландский словарь Англо-греческий словарь Англо-испанский словарь Англо-итальянский словарь Англо-немецкий словарь Англо-русский словарь Англо-французский словарь Арабский словарь Голландский словарь Греческий словарь Испанский словарь Итальянский словарь Итальянско-русский словарь Латинско-испанский словарь Латинско-португальский словарь Немецкий словарь Португальский словарь Португальско-русский словарь Русский словарь Французский словарь Французско-русский словарь
Создано ИИ
Английский Русский Испанский Португальский Немецкий Французский Греческий Голландский Итальянский Арабский
Язык интерфейса
Русский English Español Português Deutsch Français Ελληνικά Nederlands Italiano عربي
Контакты
Свяжитесь с нами



Конфиденциальность
Политика конфиденциальности