HomeSort by relevance Sort by last modified time
    Searched full:iterations (Results 76 - 100 of 600) sorted by null

1 2 34 5 6 7 8 91011>>

  /external/opencv/cv/src/
cvmorph.cpp     [all...]
  /dalvik/tests/055-enum-performance/src/
Main.java 25 System.out.println("basis: performed " + count4 + " iterations");
26 System.out.println("test1: performed " + count1 + " iterations");
27 System.out.println("test2: performed " + count2 + " iterations");
28 System.out.println("test3: performed " + count3 + " iterations");
39 System.out.println("Iterations are taking too long!");
  /packages/apps/Gallery2/jni/filters/
kmeans.h 180 int iterations, T initialPicks[]){
193 for (x = 0; x < iterations; x++) {
199 x = iterations;
210 int iterations, unsigned int seed){
216 iterations, initialPicks);
  /prebuilts/gcc/darwin-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/
predict.def 54 /* Use number of loop iterations determined by # of iterations
57 DEF_PREDICTOR (PRED_LOOP_ITERATIONS, "loop iterations", PROB_ALWAYS,
64 /* Use number of loop iterations guessed by the contents of the loop. */
65 DEF_PREDICTOR (PRED_LOOP_ITERATIONS_GUESSED, "guessed loop iterations",
  /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/
predict.def 54 /* Use number of loop iterations determined by # of iterations
57 DEF_PREDICTOR (PRED_LOOP_ITERATIONS, "loop iterations", PROB_ALWAYS,
64 /* Use number of loop iterations guessed by the contents of the loop. */
65 DEF_PREDICTOR (PRED_LOOP_ITERATIONS_GUESSED, "guessed loop iterations",
  /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/
predict.def 54 /* Use number of loop iterations determined by # of iterations
57 DEF_PREDICTOR (PRED_LOOP_ITERATIONS, "loop iterations", PROB_ALWAYS,
64 /* Use number of loop iterations guessed by the contents of the loop. */
65 DEF_PREDICTOR (PRED_LOOP_ITERATIONS_GUESSED, "guessed loop iterations",
  /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/
predict.def 54 /* Use number of loop iterations determined by # of iterations
57 DEF_PREDICTOR (PRED_LOOP_ITERATIONS, "loop iterations", PROB_ALWAYS,
64 /* Use number of loop iterations guessed by the contents of the loop. */
65 DEF_PREDICTOR (PRED_LOOP_ITERATIONS_GUESSED, "guessed loop iterations",
  /external/jmonkeyengine/engine/src/core-effects/Common/MatDefs/SSAO/
ssao.frag 87 int iterations = 4;
88 for (int j = 0; j < iterations; ++j){
98 ao /= float(iterations) * 4.0;
  /external/eigen/Eigen/src/IterativeLinearSolvers/
BiCGSTAB.h 24 * \param iters On input the max number of iteration, on output the number of performed iterations.
114 * The maximal number of iterations and tolerance value can be controlled via the setMaxIterations()
115 * and setTolerance() methods. The defaults are the size of the problem for the maximal number of iterations
127 * std::cout << "#iterations: " << solver.iterations() << std::endl;
133 * By default the iterations start with x=0 as an initial guess of the solution.
ConjugateGradient.h 23 * \param iters On input the max number of iteration, on output the number of performed iterations.
106 * The maximal number of iterations and tolerance value can be controlled via the setMaxIterations()
107 * and setTolerance() methods. The defaults are the size of the problem for the maximal number of iterations
119 * std::cout << "#iterations: " << cg.iterations() << std::endl;
125 * By default the iterations start with x=0 as an initial guess of the solution.
  /frameworks/base/graphics/tests/graphicstests/src/android/graphics/
GraphicsPerformanceTests.java 76 /** Number of iterations to pass back to harness. Subclass should override */
98 // Ask subclass for number of iterations
161 private static final int ITERATIONS = 1000;
175 return ITERATIONS;
186 for (int i = 0; i < ITERATIONS; i++) {
192 for (int i = 0; i < ITERATIONS; i++) {
  /cts/tests/tests/graphics/src/android/opengl/cts/
GLSurfaceViewTest.java 55 * between iterations.
86 * larger number of iterations can be done in a short amount of time.
  /external/ceres-solver/examples/
bundle_adjuster.cc 74 DEFINE_bool(inner_iterations, false, "Use inner iterations to non-linearly "
104 DEFINE_int32(num_iterations, 5, "Number of iterations.");
147 LOG(INFO) << "Camera blocks for inner iterations";
153 LOG(INFO) << "Point blocks for inner iterations";
159 LOG(INFO) << "Camera followed by point blocks for inner iterations";
168 LOG(INFO) << "Point followed by camera blocks for inner iterations";
177 LOG(INFO) << "Choosing automatic blocks for inner iterations";
179 LOG(FATAL) << "Unknown block type for inner iterations: "
  /external/v8/test/mjsunit/
strict-mode-opt.js 56 fail("ReferenceError after MAX iterations", "no exception");
102 fail("ReferenceError after MAX iterations", "no exception");
  /frameworks/base/core/tests/bluetoothtests/src/android/bluetooth/
BluetoothRebootStressTest.java 59 * Test method used in the middle iterations of the test to check if
70 * Test method used in the middle iterations of the test to check if
  /libcore/luni/src/test/java/libcore/java/lang/
OldAndroidMonitorTest.java 323 int iterations = 0; local
327 iterations++;
329 // System.out.println(getName() + " done after " + iterations + " iterations.");
423 int iterations = 0; local
453 iterations++;
460 // iterations + " iterations.");
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/bits/
local_lim.h 59 /* Controlling the iterations of destructors for thread-specific data. */
61 /* Number of iterations this implementation does. */
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/bits/
local_lim.h 59 /* Controlling the iterations of destructors for thread-specific data. */
61 /* Number of iterations this implementation does. */
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/bits/
local_lim.h 59 /* Controlling the iterations of destructors for thread-specific data. */
61 /* Number of iterations this implementation does. */
  /system/extras/tests/sdcard/
README 37 adb shell sdcard_perf_test --test=write --size=1000 --chunk-size=100 --procnb=1 --iterations=100
46 adb shell sdcard_perf_test --test=write --size=1000 --chunk-size=100 --procnb=1 --iterations=100 --dump >/tmp/data.txt
plot_sdcard.py 93 self.iterations = 0
105 elif line.startswith('# Iterations'):
106 self.iterations = int(re.search('# Iterations: ([0-9]+)', line).group(1))
190 readers will go thru 100 iterations much faster than the
192 iterations of the writers will likely be done w/o any influence from
203 gp.xlabel('iterations')
210 dataset.RescaleTo(metadata.iterations)
  /external/eigen/unsupported/Eigen/src/IterativeSolvers/
GMRES.h 27 * \param iters on input: maximum number of iterations to perform
28 * on output: number of iterations performed
29 * \param restart number of iterations for a restart
227 * The maximal number of iterations and tolerance value can be controlled via the setMaxIterations()
228 * and setTolerance() methods. The defaults are the size of the problem for the maximal number of iterations
239 * std::cout << "#iterations: " << solver.iterations() << std::endl;
245 * By default the iterations start with x=0 as an initial guess of the solution.
302 /** Get the number of iterations after that a restart is performed.
306 /** Set the number of iterations after that a restart is performed
    [all...]
  /bionic/tests/
benchmark.h 49 void RunRepeatedlyWithArg(int iterations, int arg);
  /dalvik/tests/302-float-conversion/src/
Main.java 40 System.out.println("Conversions failed over " + NUM_ITERATIONS + " iterations");
  /external/ceres-solver/docs/
helloworld.tex 66 Ceres Solver Report: Iterations: 2, Initial cost: 1.250000e+01, \
71 Starting from a $x=5$, the solver in two iterations goes to 10~\footnote{Actually the solver ran for three iterations, and it was by looking at the value returned by the linear solver in the third iteration, it observed that the update to the parameter block was too small and declared convergence. Ceres only prints out the display at the end of an iteration, and terminates as soon as it detects convergence, which is why you only see two iterations here and not three.}. The careful reader will note that this is a linear problem and one linear solve should be enough to get the optimal value. The default configuration of the solver is aimed at non-linear problems, and for reasons of simplicity we did not change it in this example. It is indeed possible to obtain the solution to this problem using Ceres in one iteration. Also note that the solver did get very close to the optimal function value of 0 in the very first iteration. We will discuss these issues in greater detail when we talk about convergence and parameter settings for Ceres.

Completed in 822 milliseconds

1 2 34 5 6 7 8 91011>>