Введите слово или словосочетание на любом языке 👆
Язык:
Перевод и анализ слов искусственным интеллектом ChatGPT
На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:
- как употребляется слово
- частота употребления
- используется оно чаще в устной или письменной речи
- варианты перевода слова
- примеры употребления (несколько фраз с переводом)
- этимология
nested problem - перевод на русский
METHOD OF DNA REPLICATION
Nested PCR; Nested primer
Найдено результатов: 978
nested problem
математика
вложенная задача
local function
FUNCTION DEFINED INSIDE ANOTHER FUNCTION
Nested functions; Nested procedure; Local function definition; Local function; Nested function definition; Local procedure
математика
локальная функция
knapsack problem
![multiple constrained problem]] could consider both the weight and volume of the boxes. <br />(Solution: if any number of each box is available, then three yellow boxes and three grey boxes; if only the shown boxes are available, then all except for the green box.)](https://commons.wikimedia.org/wiki/Special:FilePath/Knapsack.svg?width=200 "multiple constrained problem]] could consider both the weight and volume of the boxes. <br />(Solution: if any number of each box is available, then three yellow boxes and three grey boxes; if only the shown boxes are available, then all except for the green box.)")
PROBLEM IN COMBINATORIAL OPTIMIZATION
0/1 knapsack problem; 0-1 knapsack problem; Unbounded knapsack problem; Unbounded Knapsack Problem; Binary knapsack problem; Napsack problem; Backpack problem; 0-1 Knapsack problem; Integer knapsack problem; Knapsack Problem; Algorithms for solving knapsack problems; Methods for solving knapsack problems; Approximation algorithms for the knapsack problem; Bounded knapsack problem; Multiple knapsack problem; Rucksack problem; Computational complexity of the knapsack problem
математика
задача о ранце
knapsack problem
PROBLEM IN COMBINATORIAL OPTIMIZATION
0/1 knapsack problem; 0-1 knapsack problem; Unbounded knapsack problem; Unbounded Knapsack Problem; Binary knapsack problem; Napsack problem; Backpack problem; 0-1 Knapsack problem; Integer knapsack problem; Knapsack Problem; Algorithms for solving knapsack problems; Methods for solving knapsack problems; Approximation algorithms for the knapsack problem; Bounded knapsack problem; Multiple knapsack problem; Rucksack problem; Computational complexity of the knapsack problem
задача об укладке ранца (рюкзака)
assignment problem
COMBINATORIAL OPTIMIZATION PROBLEM
Linear assignment problem; Unbalanced assignment problem; Credit assignment problem
1) задача о назначениях
2) задача о распределении (напр. ресурсов)
2) задача о распределении (напр. ресурсов)
assignment problem
COMBINATORIAL OPTIMIZATION PROBLEM
Linear assignment problem; Unbalanced assignment problem; Credit assignment problem
математика
задача о назначениях
traveling salesman problem
![1) An ant chooses a path among all possible paths and lays a pheromone trail on it. 2) All the ants are travelling on different paths, laying a trail of pheromones proportional to the quality of the solution. 3) Each edge of the best path is more reinforced than others. 4) Evaporation ensures that the bad solutions disappear. The map is a work of Yves Aubry [http://openclipart.org/clipart//geography/carte_de_france_01.svg].](https://commons.wikimedia.org/wiki/Special:FilePath/Aco TSP.svg?width=200 "1) An ant chooses a path among all possible paths and lays a pheromone trail on it. 2) All the ants are travelling on different paths, laying a trail of pheromones proportional to the quality of the solution. 3) Each edge of the best path is more reinforced than others. 4) Evaporation ensures that the bad solutions disappear. The map is a work of Yves Aubry [http://openclipart.org/clipart//geography/carte_de_france_01.svg].")
NP-HARD PROBLEM IN COMBINATORIAL OPTIMIZATION
Traveling salesperson problem; Traveling Salesman Problem; Euclidean traveling salesman problem; Euclidean TSP; Wandering salesman problem; Traveling salesman problem; Euclidian TSP; Travelling salesperson problem; Salesman problem; Tsp problem; TSP Problem; Travelling Salesman Problem; Travelling Salesman problem; Traveling Salesman problem; Travelling-salesman problem; Euclidean traveling salesman; Metric traveling salesman; Euclidean travelling salesman; Generalized travelling salesman problem; Generalized traveling salesman problem; Traveling tourist problem; Delta travelling salesman problem; Metric tsp; Willy Loman problem; Salesperson Problem; Travelling salesmen problem; Metric TSP; Traveling salesmen problem; Euclidean travelling salesman problem; Traveling salesman puzzle; Salesman Problem; TSP problem; Approximation algorithms for the traveling salesman problem; Computational complexity of the travelling salesman problem
задача коммивояжёра
travelling salesman problem
NP-HARD PROBLEM IN COMBINATORIAL OPTIMIZATION
Traveling salesperson problem; Traveling Salesman Problem; Euclidean traveling salesman problem; Euclidean TSP; Wandering salesman problem; Traveling salesman problem; Euclidian TSP; Travelling salesperson problem; Salesman problem; Tsp problem; TSP Problem; Travelling Salesman Problem; Travelling Salesman problem; Traveling Salesman problem; Travelling-salesman problem; Euclidean traveling salesman; Metric traveling salesman; Euclidean travelling salesman; Generalized travelling salesman problem; Generalized traveling salesman problem; Traveling tourist problem; Delta travelling salesman problem; Metric tsp; Willy Loman problem; Salesperson Problem; Travelling salesmen problem; Metric TSP; Traveling salesmen problem; Euclidean travelling salesman problem; Traveling salesman puzzle; Salesman Problem; TSP problem; Approximation algorithms for the traveling salesman problem; Computational complexity of the travelling salesman problem
задача коммивояжера
secretary problem
MATHEMATICAL PROBLEM
Sultan's Dowry Problem; Sultan's dowry problem; Secretary problems; 37% rule; 37% Rule
математика
задача о секретаре
задача о выборе наилучшего объекта
menage problem
ASSIGNMENT PROBLEM IN COMBINATORIAL MATHEMATICS
Menage problem; Problème des ménages; Ménage number; Married couples problem; Laisant's Recurrence Formula; Laisant's recurrence formula; Ménage Number; Married Couples Problem
математика
задача о гостях
Определение
0/1 knapsack problem
<application> The knapsack problem restricted so that the
number of each item is zero or one.
(1995-03-13)
Википедия
Nested polymerase chain reaction
Nested polymerase chain reaction (nested PCR) is a modification of polymerase chain reaction intended to reduce non-specific binding in products due to the amplification of unexpected primer binding sites.
