| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/direct/ |
| DirectSearchOptimizer.java | 37 * This class implements simplex-based direct search optimization
52 * <p>Simplex-based direct search methods are based on comparison of
53 * the objective function values at the vertices of a simplex (which is a
57 * <p>The initial configuration of the simplex can be set using either
74 * previous and current simplex to the convergence checker, not the best ones.</p>
76 * <p>This class is the base class performing the boilerplate simplex
77 * initialization and handling. The simplex update by itself is
91 /** Simplex. */
92 protected RealPointValuePair[] simplex; field in class:DirectSearchOptimizer
112 /** Start simplex configuration. *
[all...] |
| MultiDirectional.java | 70 final RealPointValuePair[] original = simplex;
77 // compute the expanded simplex
78 final RealPointValuePair[] reflectedSimplex = simplex;
81 // accept the reflected simplex
82 simplex = reflectedSimplex;
89 // compute the contracted simplex
92 // accept the contracted simplex
99 for (int i = 0; i < simplex.length; ++i) {
100 converged &= checker.converged(iter, original[i], simplex[i]);
110 /** Compute and evaluate a new simplex
[all...] |
| NelderMead.java | 79 // the simplex has n+1 point if dimension is n
80 final int n = simplex.length - 1;
83 final RealPointValuePair best = simplex[0];
84 final RealPointValuePair secondBest = simplex[n-1];
85 final RealPointValuePair worst = simplex[n];
92 final double[] x = simplex[i].getPointRef();
167 final double[] xSmallest = simplex[0].getPointRef();
168 for (int i = 1; i < simplex.length; ++i) {
169 final double[] x = simplex[i].getPoint();
173 simplex[i] = new RealPointValuePair(x, Double.NaN, false)
[all...] |
| /external/mesa3d/src/mesa/program/ |
| prog_noise.c | 34 * \brief C implementation of Perlin Simplex Noise over 1, 2, 3 and 4 dims.
38 * This implementation is "Simplex Noise" as presented by
140 * (The simplex noise functions as such also have different scaling.)
187 * A lookup table to traverse the simplex around a given point in 4D.
191 static unsigned char simplex[64][4] = { variable
211 /** 1D simplex noise */
237 /** 2D simplex noise */
246 /* Skew the input space to determine which simplex cell we're in */
263 /* For the 2D case, the simplex shape is an equilateral triangle. */
264 /* Determine which simplex we are in. *
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/linear/ |
| SimplexSolver.java | 29 * Solves a linear problem using the Two-Phase Simplex Method.
42 * Build a simplex solver with default settings.
49 * Build a simplex solver with a specified accepted amount of error
117 * Runs one iteration of the Simplex method on the given model.
147 * Solves Phase 1 of the Simplex method.
|
| SimplexTableau.java | 39 * A tableau for use in the Simplex method.
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/ |
| RealConvergenceChecker.java | 45 * compared. As an example, simplex-based algorithms call this method for all
46 * points of the simplex, not only for the best or worst ones.
|
| VectorialConvergenceChecker.java | 45 * compared. As an example, simplex-based algorithms call this method for all
46 * points of the simplex, not only for the best or worst ones.
|
| /frameworks/ml/bordeaux/learning/stochastic_linear_ranker/native/ |
| sparse_weight_vector.cpp | 305 // applies a probability simplex projection to the abs(vector)
325 // Compute projection on the probability simplex.
|
| /external/libpcap/ |
| CREDITS | 128 Onno van der Linden <onno at simplex dot nl>
|
| /external/tcpdump/ |
| CREDITS | 156 Onno van der Linden <onno at simplex dot nl>
|
| CHANGES | 474 Token Ring support on DLPI - Onno van der Linden <onno@simplex.nl>
657 (onno@simplex.nl)
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/exception/util/ |
| LocalizedFormats.java | 93 EQUAL_VERTICES_IN_SIMPLEX("equal vertices {0} and {1} in simplex configuration"),
261 SIMPLEX_NEED_ONE_POINT("simplex must contain at least one point"),
|
| /external/pdfium/fpdfsdk/src/ |
| fpdfview.cpp | 791 if (FX_BSTRC("Simplex") == duplex)
792 return Simplex;
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/flow/ |
| mincost.py | 225 This is a primal network simplex algorithm that uses the leaving
318 node v a demand a 1. Then run the network simplex. The value of a
|
| /external/kernel-headers/original/uapi/scsi/fc/ |
| fc_els.h | 267 #define FC_SP_FT_SIMP 0x0040 /* dedicated simplex */
|
| /external/pdfium/public/ |
| fpdfview.h | 48 Simplex,
|
