HomeSort by relevance Sort by last modified time
    Searched defs:solution (Results 1 - 22 of 22) sorted by null

  /external/ceres-solver/internal/ceres/
compressed_col_sparse_matrix_utils_test.cc 264 double solution[4]; local
276 solution);
278 EXPECT_NEAR(solution[j], expected[4 * i + j], 1e-3) << i;
line_search.cc 346 FunctionSample solution, bracket_low, bracket_high; local
418 &solution,
419 summary) && !solution.value_is_valid) {
429 solution =
430 solution.value_is_valid && solution.value <= bracket_low.value
431 ? solution : bracket_low;
433 summary->optimal_step_size = solution.x;
637 // Returns true iff solution satisfies the strong Wolfe conditions. Otherwise,
639 // reaching max_num_iterations, solution is the step size amongst all thos
    [all...]
covariance_impl.cc 514 // is given by the solution to the linear system
539 double* solution = workspace.get() + thread_id * num_cols; local
546 solution);
549 values[idx] = solution[inverse_permutation[c]];
702 // is given by the solution to the linear system
728 double* solution = workspace.get() + thread_id * num_cols; local
735 solution);
741 values[idx] = solution[inverse_permutation.indices().coeff(c)];
visibility_based_preconditioner.cc 468 cholmod_dense* solution = local
470 memcpy(y, solution->x, sizeof(*y) * num_rows);
471 ss->Free(solution);
  /packages/apps/Gallery2/src/com/android/gallery3d/filtershow/filters/
SplineMath.java 116 double[] solution = new double[n]; // returned coefficients local
148 solution[n - 1] = result[n - 1] / system[n - 1][1];
150 solution[i] = (result[i] - system[i][2] * solution[i + 1]) / system[i][1];
152 return solution;
  /external/llvm/lib/CodeGen/
RegAllocPBQP.cpp 13 // solving this using a PBQP solver, and mapping the solution back to a
141 /// \brief Given a solved PBQP problem maps this solution back to a register
144 const PBQP::Solution &solution);
461 const PBQP::Solution &solution) {
469 // Iterate over the nodes mapping the PBQP solution to a register
473 unsigned alloc = solution.getSelection(NId);
557 // * Map the solution back to a register allocation
597 PBQP::Solution solution local
    [all...]
  /packages/apps/Gallery2/src/com/android/gallery3d/filtershow/imageshow/
Spline.java 352 double[] solution = new double[n]; // returned coefficients local
384 solution[n - 1] = result[n - 1] / system[n - 1][1];
386 solution[i] = (result[i] - system[i][2] * solution[i + 1]) / system[i][1];
388 return solution;
  /external/opencv/cvaux/src/
cvlmeds.cpp 678 double solution[9]; local
747 { /* ----------- computing the solution ----------- */
781 /* ----------- solution = V * W(-1) * U(T) * f ----------- */
787 solution[a] = 0;
791 solution[a] += temp2[a_num + t] * f[t];
801 solution[a] = solution[a - 1];
804 solution[a] = 1;
816 summ += A[a9 + t] * solution[t];
828 F[j] = solution[j]
    [all...]
  /packages/apps/Launcher2/src/com/android/launcher2/
CellLayout.java     [all...]
  /packages/apps/Launcher3/src/com/android/launcher3/
CellLayout.java     [all...]
  /prebuilts/eclipse/mavenplugins/tycho/tycho-dependencies-m2repo/org/eclipse/tycho/tycho-bundles-external/0.20.0/eclipse/plugins/
org.sat4j.core_2.3.5.v201308161310.jar 
org.eclipse.equinox.p2.director_2.3.1.v20140221-1852.jar 
org.sat4j.pb_2.3.5.v201308161310.jar 
  /prebuilts/tools/common/m2/repository/org/eclipse/tycho/tycho-bundles-external/0.18.1/eclipse/plugins/
org.sat4j.core_2.3.5.v20130525.jar 
org.eclipse.equinox.p2.director_2.3.0.v20130526-0335.jar 
org.sat4j.pb_2.3.5.v20130525.jar 
  /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
org.eclipse.equinox.p2.director_2.0.3.R36x_v20101117-1018.jar 
org.eclipse.swt.gtk.linux.x86_3.6.1.v3657a.jar 
org.eclipse.swt.win32.win32.x86_3.6.1.v3657a.jar 
  /prebuilts/misc/common/groovy/
groovy-all-1.7.0.jar 
  /prebuilts/tools/common/m2/repository/com/cenqua/clover/clover/3.1.12/
clover-3.1.12.jar 
  /prebuilts/tools/common/m2/repository/org/codehaus/groovy/groovy-all/2.2.1/
groovy-all-2.2.1.jar 

Completed in 538 milliseconds