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

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

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

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

problem of projectivity - перевод на русский

THE EXACTLY SOLVABLE PROBLEM OF A PARTICLE THAT IS ACTED UPON BY THE GRAVITATIONAL FIELD OF TWO OTHER POINT MASSES THAT ARE FIXED IN SPACE
Euler three-body problem; Restricted 3-body problem; Euler's three body problem; Copenhagen problem; Pythagorean problem; Problem of two fixed centers; Euler-Jacobi problem; Problem of two centers; Problem of two centers of gravitation; Two-center Kepler problem; Problem of two fixed centres; Problem of two centres; Two-centre Kepler problem; Problem of two centres of gravitation; Darboux's problem; Velde's problem; Copenhagen Problem; CRTBP
Найдено результатов: 51778
problem of projectivity      

математика

проблема проективности

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.)
  • A demonstration of the dynamic programming approach.
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         
  • 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.)
  • A demonstration of the dynamic programming approach.
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) задача о распределении (напр. ресурсов)
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].
  • Ant colony optimization algorithm for a TSP with 7 cities: Red and thick lines in the pheromone map indicate presence of more pheromone
  • Solution of a TSP with 7 cities using a simple Branch and bound algorithm. Note: The number of permutations is much less than Brute force search
  • Solution to a symmetric TSP with 7 cities using brute force search. Note: Number of permutations: (7&minus;1)!/2 = 360
  • Creating a matching
  • Nearest Neighbour algorithm for a TSP with 7 cities. The solution changes as the starting point is changed
  • An example of a 2-opt iteration
  • Using a shortcut heuristic on the graph created by the matching above
  • Symmetric TSP with four cities
  • William Rowan Hamilton
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         
  • 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].
  • Ant colony optimization algorithm for a TSP with 7 cities: Red and thick lines in the pheromone map indicate presence of more pheromone
  • Solution of a TSP with 7 cities using a simple Branch and bound algorithm. Note: The number of permutations is much less than Brute force search
  • Solution to a symmetric TSP with 7 cities using brute force search. Note: Number of permutations: (7&minus;1)!/2 = 360
  • Creating a matching
  • Nearest Neighbour algorithm for a TSP with 7 cities. The solution changes as the starting point is changed
  • An example of a 2-opt iteration
  • Using a shortcut heuristic on the graph created by the matching above
  • Symmetric TSP with four cities
  • William Rowan Hamilton
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
задача коммивояжера
three body problem         
  • elastically]] isn't.
  • The circular restricted three-body problem is a valid approximation of elliptical orbits found in the [[Solar System]], and this can be visualized as a combination of the potentials due to the gravity of the two primary bodies along with the centrifugal effect from their rotation ([[Coriolis effect]]s are dynamic and not shown). The [[Lagrange points]] can then be seen as the five places where the gradient on the resultant surface is zero (shown as blue lines), indicating that the forces are in balance there.
  • An animation of the figure-8 solution to the three-body problem over a single period T ≃ 6.3259.<ref>Here the gravitational constant ''G'' has been set to 1, and the initial conditions are '''r'''<sub>1</sub>(0) = −'''r'''<sub>3</sub>(0) = (−0.97000436, 0.24308753); '''r'''<sub>2</sub>(0) = (0,0); '''v'''<sub>1</sub>(0) = '''v'''<sub>3</sub>(0) = (0.4662036850, 0.4323657300); '''v'''<sub>2</sub>(0) = (−0.93240737, −0.86473146). The values are obtained from Chenciner & Montgomery (2000).</ref>
CLASSICAL MECHANICS PROBLEM OF THREE MASSIVE POINT PARTICLES INTERACTING VIA NEWTONIAN GRAVITY; SPECIAL CASE OF THE 𝑛‐BODY PROBLEM FOR 𝑛=3
Three body problem; 3 body problem; Problem of Three Bodies; Three-Body Problem; Earth-Moon-Sun system; Restricted three-body problem; Restricted three body problem; Restricted 3 body problem; Sundman's theorem for the 3-body problem; The three body problem; Circular restricted three-body problem; 3-body problem; Constant-pattern solution; Three Body Problem; Shape sphere; CR3BP; Three-body Problem; User:Dontbotherme123/Three-body Problem
задача о трех телах
secretary problem         
  • Learning in the partial-information sequential search paradigm. The numbers display the expected values of applicants based on their relative rank (out of m total applicants seen so far) at various points in the search. Expectations are calculated based on the case when their values are uniformly distributed between 0 and 1. Relative rank information allows the interviewer to more finely evaluate applicants as they accumulate more data points to compare them to.
MATHEMATICAL PROBLEM
Sultan's Dowry Problem; Sultan's dowry problem; Secretary problems; 37% rule; 37% Rule

математика

задача о секретаре

задача о выборе наилучшего объекта

menage problem         
  • Crown graphs with six, eight, and ten vertices. The outer cycle of each graph forms a Hamiltonian cycle; the eight and ten vertex graphs also have other Hamiltonian cycles.
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

математика

задача о гостях

Определение

грип
ГРИП, ГРИПП, гриппа, ·муж. (·франц. grippe) (мед.). Инфекционная болезнь - катарральное воспаление дыхательных путей, сопровождаемое лихорадочным состоянием; то же, что инфлуэнца
.

Википедия

Euler's three-body problem

In physics and astronomy, Euler's three-body problem is to solve for the motion of a particle that is acted upon by the gravitational field of two other point masses that are fixed in space. This problem is exactly solvable, and yields an approximate solution for particles moving in the gravitational fields of prolate and oblate spheroids. This problem is named after Leonhard Euler, who discussed it in memoirs published in 1760. Important extensions and analyses were contributed subsequently by Lagrange, Liouville, Laplace, Jacobi, Darboux, Le Verrier, Velde, Hamilton, Poincaré, Birkhoff and E. T. Whittaker, among others.

Euler's problem also covers the case when the particle is acted upon by other inverse-square central forces, such as the electrostatic interaction described by Coulomb's law. The classical solutions of the Euler problem have been used to study chemical bonding, using a semiclassical approximation of the energy levels of a single electron moving in the field of two atomic nuclei, such as the diatomic ion HeH2+. This was first done by Wolfgang Pauli in his doctoral dissertation under Arnold Sommerfeld, a study of the first ion of molecular hydrogen, namely the hydrogen molecule-ion H2+. These energy levels can be calculated with reasonable accuracy using the Einstein–Brillouin–Keller method, which is also the basis of the Bohr model of atomic hydrogen. More recently, as explained further in the quantum-mechanical version, analytical solutions to the eigenvalues (energies) have been obtained: these are a generalization of the Lambert W function.

The exact solution, in the full three dimensional case, can be expressed in terms of Weierstrass's elliptic functions For convenience, the problem may also be solved by numerical methods, such as Runge–Kutta integration of the equations of motion. The total energy of the moving particle is conserved, but its linear and angular momentum are not, since the two fixed centers can apply a net force and torque. Nevertheless, the particle has a second conserved quantity that corresponds to the angular momentum or to the Laplace–Runge–Lenz vector as limiting cases.

The Euler three-body problem is known by a variety of names, such as the problem of two fixed centers, the Euler–Jacobi problem, and the two-center Kepler problem. Various generalizations of Euler's problem are known; these generalizations add linear and inverse cubic forces and up to five centers of force. Special cases of these generalized problems include Darboux's problem and Velde's problem.

Как переводится problem of projectivity на Русский язык