| /external/valgrind/main/drd/tests/ |
| omp_printf.c | 26 int num_iterations = 2; local
34 case 'i': num_iterations = atoi(optarg); break;
46 assert(num_iterations > 0);
53 for (i = 0; i < num_iterations; i++)
|
| /external/ceres-solver/internal/ceres/ |
| conjugate_gradients_solver.cc | 80 summary.num_iterations = 0;
115 for (summary.num_iterations = 1;
116 summary.num_iterations < options_.max_num_iterations;
117 ++summary.num_iterations) {
118 VLOG(3) << "cg iteration " << summary.num_iterations;
137 if (summary.num_iterations == 1) {
176 if (summary.num_iterations % options_.residual_reset_period == 0) {
210 double zeta = summary.num_iterations * (Q1 - Q0) / Q1;
|
| trust_region_strategy.h | 92 num_iterations(-1),
108 int num_iterations; member in struct:ceres::internal::TrustRegionStrategy::Summary
|
| dense_qr_solver.cc | 84 summary.num_iterations = 1;
|
| iterative_schur_complement_solver.cc | 126 cg_summary.num_iterations = 0;
140 VLOG(2) << "CG Iterations : " << cg_summary.num_iterations;
|
| linear_solver.h | 241 num_iterations(-1),
246 int num_iterations; member in struct:ceres::internal::LinearSolver::Summary
|
| levenberg_marquardt_strategy.cc | 119 summary.num_iterations = linear_solver_summary.num_iterations;
|
| dense_normal_cholesky_solver.cc | 80 summary.num_iterations = 1;
|
| symmetric_linear_solver_test.cc | 75 ASSERT_EQ(summary.num_iterations, 1);
|
| sparse_normal_cholesky_solver.cc | 107 summary.num_iterations = 1;
222 summary.num_iterations = 1;
|
| dogleg_strategy.cc | 100 summary.num_iterations = 0;
134 summary.num_iterations = linear_solver_summary.num_iterations;
|
| solver_impl_test.cc | 674 int num_iterations; local
678 num_iterations = summary.num_successful_steps +
680 EXPECT_GT(num_iterations, 1);
690 num_iterations = summary.num_successful_steps +
692 EXPECT_GT(num_iterations, 1);
|
| schur_complement_solver.cc | 80 summary.num_iterations = 1;
|
| trust_region_minimizer.cc | 257 strategy_summary.num_iterations;
|
| /external/webrtc/src/system_wrappers/source/ |
| cpu_measurement_harness.cc | 99 int num_iterations = 0; local
103 while (!cpu_usage_available && (++num_iterations < 10000)) {
|
| cpu_wrapper_unittest.cc | 45 int num_iterations = 0; local
52 while (!cpu_usage_available && (++num_iterations < 10000)) {
|
| /frameworks/ml/bordeaux/learning/multiclass_pa/native/ |
| multiclass_pa.h | 65 // Iteratively train the model for num_iterations on the given dataset.
67 int num_iterations);
70 int num_iterations);
|
| multiclass_pa.cpp | 172 int num_iterations) {
175 for (int t = 0; t < num_iterations; ++t) {
180 return total_loss / static_cast<float>(num_iterations);
185 int num_iterations) {
188 for (int t = 0; t < num_iterations; ++t) {
193 return total_loss / static_cast<float>(num_iterations);
|
| /external/chromium/sdch/open-vcdiff/src/ |
| addrcache_test.cc | 609 const int num_iterations = 40; // run test 40 times and take average local
614 BM_CacheEncode(num_iterations, test_size);
619 << (encode_time_in_ms / num_iterations) << " ms" << std::endl;
624 BM_CacheDecode(num_iterations, test_size);
629 << (decode_time_in_ms / num_iterations) << " ms" << std::endl;
|
| /external/open-vcdiff/src/ |
| addrcache_test.cc | 609 const int num_iterations = 40; // run test 40 times and take average local
614 BM_CacheEncode(num_iterations, test_size);
619 << (encode_time_in_ms / num_iterations) << " ms" << std::endl;
624 BM_CacheDecode(num_iterations, test_size);
629 << (decode_time_in_ms / num_iterations) << " ms" << std::endl;
|
| /external/ceres-solver/examples/ |
| bundle_adjuster.cc | 104 DEFINE_int32(num_iterations, 5, "Number of iterations.");
|
| nist.cc | 63 DEFINE_int32(num_iterations, 10000, "Number of iterations");
|
