与 «SUBPROBLEM»相关的英语书籍
在以下的参考文献中发现
subproblem的用法。与
subproblem相关的书籍以及同一来源的简短摘要提供其在 英语文献中的使用情境。
1
Introduction to Optimum Design
In this section, we define a QP subproblem to determine the search direction. We
also discuss a method for solving the problem. Note that in the SLP method of the
previous section, the vector d represents design change at the current point.
2
A Guide to Research in Music Education
In many theses and dissertations each subproblem eventually becomes a
separate chapter in the final document after all the data have been collected.
Using the hypothetical statement of the problem finally determined, examine
each of these ...
3
Cognitive Archaeology and Human Evolution
Subproblem 1 (in principle, semi-acute): hunt prey 00b. Subproblem 2 (in
principle, semi-acute): need of spear (tool 1) 00c1. Subproblem 3A (semi-acute):
need of handaxe to cut down tree (tool 2): quality A 00c1. Subproblem 3B (semi-
acute): ...
Sophie A. de Beaune, Frederick L. Coolidge, Thomas Wynn, 2009
4
A Gentle Introduction to Optimization
Clearly, in order to find an optimal solution to (6.4) it suffices to find the best
integer solution in both Subproblem 2 and Subproblem 3. None of the two
subproblems contains (2.8, 1.8) and this solution can therefore not re-occur when
solving ...
B. Guenin, J. Könemann, L. Tunçel, 2014
5
Introduction To Algorithms
To solve the subproblem S//, we choose the activity am in Stj with the earliest
finish time and add to this solution the set of activities used in an optimal solution
to the subproblem 5mj. Because we know that, having chosen am, we will
certainly ...
6
ECAI 2006: 17th European Conference on Artificial ...
We observe that decomposition only makes sense if the second subproblem has
a variable that is not contained in the first subproblem. As a consequence, we
stop decomposition if all the constraints in a subproblem share the last variable of
...
choose one subproblem at a time to solve. We may break the chosen
subproblem into another series of steps that, in turn, become smaller
subproblems. Or we may identify components that are naturally represented as
objects. The process ...
Nell B. Dale, Chip Weems, 2004
~t~ / J / j / J / j DQim[Qing Qimp)'-EPimpnq (7.53) + E E E £ ( ~ Dvik ) XPimpnq- (
7.54) The final objective function for the port subproblem, (7.50)-(7.54), is written
with five terms. This function has to be minimized subject to the time constraints ...
Guy Desaulniers, Jacques Desrosiers, Marius M. Solomon, 2006
9
Encyclopedia of Optimization
The solution to the linear programming relaxation of the first subproblem is (1, 3),
with value — 23. Since this solution is integral, it solves the first subproblem. This
solution becomes the incumbent best known feasible solution. The optimal ...
Christodoulos A. Floudas, Panos M. Pardalos, 2008
10
Principles and Practice of Constraint Programming - CP98: ...
Each key of a subproblem opens at least one lock of the subproblem and each
lock of a subproblem is opened by at least one key of the subproblem. 2. A
subproblem has either none or more than one nested subproblem. 3. A key or
lock of a ...
Michael Maher, Jean-Francois Puget, 1998
