Searched refs:optimum (Results 1 – 18 of 18) sorted by relevance
654 Optimal optimum = _optimum[repLen]; in GetOptimum() local655 if (curAndLenPrice < optimum.Price) in GetOptimum()657 optimum.Price = curAndLenPrice; in GetOptimum()658 optimum.PosPrev = 0; in GetOptimum()659 optimum.BackPrev = i; in GetOptimum()660 optimum.Prev1IsChar = false; in GetOptimum()678 Optimal optimum = _optimum[len]; in GetOptimum() local679 if (curAndLenPrice < optimum.Price) in GetOptimum()681 optimum.Price = curAndLenPrice; in GetOptimum()682 optimum.PosPrev = 0; in GetOptimum()[all …]
654 Optimal optimum = _optimum[repLen]; in GetOptimum()655 if (curAndLenPrice < optimum.Price) in GetOptimum()657 optimum.Price = curAndLenPrice; in GetOptimum()658 optimum.PosPrev = 0; in GetOptimum()659 optimum.BackPrev = i; in GetOptimum()660 optimum.Prev1IsChar = false; in GetOptimum()678 Optimal optimum = _optimum[len]; in GetOptimum()679 if (curAndLenPrice < optimum.Price) in GetOptimum()681 optimum.Price = curAndLenPrice; in GetOptimum()682 optimum.PosPrev = 0; in GetOptimum()[all …]
185 double optimum) { in newPointAndDirection() argument191 nD[i] = d[i] * optimum; in newPointAndDirection()213 private double optimum = Double.NaN; field in PowellOptimizer.LineSearch241 optimum = Double.NaN; in search()261 optimum = optim.optimize(f, goal, in search()275 return optimum; in getOptimum()
140 VectorialPointValuePair optimum = in fit() local144 return optimum.getPointRef(); in fit()
283 // Extension of the `.form-inline` with some extra flavor for optimum display in295 // Mixin behavior for optimum display
43 // is required to ensure optimum display with or without those classes to better
43 - ``cffLib.width``: Calculate optimum defaultWidthX/nominalWidthX values
490 Optional<Fraction> optimum = computeRowOptimum(direction, row); in computeOptimum() local492 return optimum; in computeOptimum()
3281 … merging; magnetic storage systems; mass storage; merging; optimisation; optimum merging; sort tim…4322 title = "An approach to the optimum design of computer graphics systems",4335 …computer graphics systems; computer metatheory; mathematical; model; optimisation; optimum design",4582 …that the results do not depend on a particular distribution function. An optimum output buffer siz…4586 … function; input output operations; item; merge sort; movable arm disks; optimum; output buffer si…5216 …spersion algorithms for the polyphase sorting procedure are examined.The optimum algorithm based o…5220 …persion algorithm; dispersion algorithms; minimizing; optimisation; optimum; optimum dispersion al…6736 …ed to execute simultaneously; optimisation; optimization of performance; optimum round robin cycle…8539 …erived for treating decision tables not containing an ELSE-rule, but the optimum-approaching algor…8545 … execution time; near; optimal flowcharts; optimisation; optimum approaching algorithm; optimum fi…[all …]
613 J. D. Foley An approach to the optimum design of
352 optimum settings and should only be changed in exceptional circumstances!
321 If the original problem has a bounded optimum, then the final sample327 When the optimum is unbounded, the optimal value computed for
8728 In case of union sets, the optimum is computed per space.8776 In case of union relations, the optimum is computed per space.
2271 buffered image to determine the optimum color map; it therefore may take a
META-INF/ META-INF/MANIFEST.MF vogar/ vogar/TestProperties.class TestProperties ...
17290 最佳 < optimum;32881 最佳 > optimum;