-
1 subproblema
= sub-problem [subproblem].Ex. The problem is then solved by a algorithm which exploits the unimodular structure of the subproblems.* * *= sub-problem [subproblem].Ex: The problem is then solved by a algorithm which exploits the unimodular structure of the subproblems.
-
2 unimodular
= unimodular.Ex. The problem is then solved by a algorithm which exploits the unimodular structure of the subproblems.* * *= unimodular.Ex: The problem is then solved by a algorithm which exploits the unimodular structure of the subproblems.
-
3 Как мы увидим далее в
General subject: As we shall see throughout the book, a great many algorithms are based on the principle of recursively decomposing a large problem into one or more smaller ones, using solutions to the subproblems to solve the original problemУниверсальный русско-английский словарь > Как мы увидим далее в
-
4 решения подзадач
Programming: solutions to the subproblems -
5 решения подзадач используются для решения исходной задачи
Универсальный русско-английский словарь > решения подзадач используются для решения исходной задачи
-
6 dynamic programming
Gen Mgta mathematical technique used in management science to solve complex problems in the fields of production planning and inventory control. Dynamic programming divides the problem into subproblems or decision stages that can be addressed sequentially, normally by working backward from the last stage. Applications of the technique include maintenance and replacement of equipment, resource allocation, and process design and control. The term comes from the work of Richard Bellman published in the late 1950s and early 1960s.
См. также в других словарях:
Overlapping subproblems — In computer science, a problem is said to have overlapping subproblems if the problem can be broken down into subproblems which are reused several times or a recursive algorithm for the problem solves the same subproblem over and over rather than … Wikipedia
Dynamic programming — For the programming paradigm, see Dynamic programming language. In mathematics and computer science, dynamic programming is a method for solving complex problems by breaking them down into simpler subproblems. It is applicable to problems… … 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
Divide and conquer algorithm — In computer science, divide and conquer (D C) is an important algorithm design paradigm based on multi branched recursion. A divide and conquer algorithm works by recursively breaking down a problem into two or more sub problems of the same (or… … Wikipedia
Longest common subsequence problem — Not to be confused with longest common substring problem. The longest common subsequence (LCS) problem is to find the longest subsequence common to all sequences in a set of sequences (often just two). Note that subsequence is different from a… … Wikipedia
Dantzig–Wolfe decomposition — is an algorithm for solving linear programming problems with special structure. It was originally developed by George Dantzig and Phil Wolfe and initially published in 1960[1]. Many texts on linear programming have sections dedicated to… … Wikipedia
Parallel mesh generation — in numerical analysis is a new research area between the boundaries of two scientific computing disciplines: computational geometry and parallel computingNikos Chrisochoides, Parallel Mesh Generation, Chapter in Numerical Solution of Partial… … Wikipedia
Optimal substructure — Figure 1. Finding the shortest path using optimal substructure. Numbers represent the length of the path; straight lines indicate single edges, wavy lines indicate shortest paths, i.e., there might be other vertices that are not shown here. In… … Wikipedia
Overlapping subproblem — In computer science, a problem is said to have overlapping subproblems if the problem can be broken down into subproblems which are reused several times.For example, the problem of computing the Fibonacci sequence exhibits overlapping subproblems … Wikipedia
Linear programming relaxation — In mathematics, the linear programming relaxation of a 0 1 integer program is the problem that arises by replacing the constraint that each variable must be 0 or 1 by a weaker constraint, that each variable belong to the interval [0,1] .That is,… … Wikipedia
Kirkpatrick–Seidel algorithm — The Kirkpatrick–Seidel algorithm, called by its authors the ultimate planar convex hull algorithm is an algorithm for computing the convex hull of a set of points in the plane, with O( n log h ) time complexity, where n is the number of input… … Wikipedia
