Searched defs:cost (Results 1 - 25 of 87) sorted by relevance

1234

/external/ceres-solver/internal/ceres/
H A Devaluator_test_utils.h41 double cost; member in struct:ceres::internal::ExpectedEvaluation
H A Dline_search_minimizer.h53 : cost(0.0),
61 double cost; member in struct:ceres::internal::LineSearchMinimizer::State
H A Devaluator.h52 // The Evaluator interface offers a way to interact with a least squares cost
75 // This is used for computing the cost, residual and Jacobian for
81 // which case they will not be evaluated. cost cannot be NULL.
95 double* cost,
130 // Evaluate the cost function for the given state. Returns the cost,
137 // state is an array of size NumParameters(), cost is a pointer to a single
141 double* cost,
150 double* cost,
156 cost,
149 Evaluate(const double* state, double* cost, double* residuals, double* gradient, SparseMatrix* jacobian) argument
[all...]
H A Dresidual_block_utils.cc48 double* cost,
54 InvalidateArray(1, cost);
84 double* cost,
87 CHECK_NOTNULL(cost);
135 double* cost,
47 InvalidateEvaluation(const ResidualBlock& block, double* cost, double* residuals, double** jacobians) argument
82 EvaluationToString(const ResidualBlock& block, double const* const* parameters, double* cost, double* residuals, double** jacobians) argument
133 IsEvaluationValid(const ResidualBlock& block, double const* const* parameters, double* cost, double* residuals, double** jacobians) argument
H A Dresidual_block.cc68 double* cost,
108 InvalidateEvaluation(*this, cost, residuals, eval_jacobians);
116 cost,
127 cost,
159 *cost = 0.5 * squared_norm;
165 *cost = 0.5 * rho[0];
201 // space to store the residuals, which is needed for cost-only evaluations.
67 Evaluate(const bool apply_loss_function, double* cost, double* residuals, double** jacobians, double* scratch) const argument
H A Dresidual_block_test.cc42 // Trivial cost function that accepts three arguments.
106 // Verify cost-only evaluation.
107 double cost; local
108 residual_block.Evaluate(true, &cost, NULL, NULL, scratch);
109 EXPECT_EQ(0.5 * (0*0 + 1*1 + 2*2), cost);
111 // Verify cost and residual evaluation.
113 residual_block.Evaluate(true, &cost, residuals, NULL, scratch);
114 EXPECT_EQ(0.5 * (0*0 + 1*1 + 2*2), cost);
119 // Verify cost, residual, and jacobian evaluation.
120 cost
246 double cost; local
[all...]
H A Dresidual_block_utils_test.cc60 double cost; local
66 &cost,
/external/iptables/include/linux/netfilter/
H A Dxt_limit.h20 __u32 credit_cap, cost; member in struct:xt_rateinfo
/external/kernel-headers/original/linux/netfilter/
H A Dxt_limit.h16 u_int32_t credit_cap, cost; member in struct:xt_rateinfo
/external/ceres-solver/examples/
H A Dquadratic_numeric_diff.cc46 // A cost functor that implements the residual r = 10 - x.
63 // Set up the only cost function (also known as residual). This uses
65 CostFunction* cost = local
71 problem.AddResidualBlock(cost, NULL, &x);
H A Dcircle_fit.cc71 // The cost for a single sample. The returned residual is related to the
90 // It is tempting to use the following cost:
95 // reasonably well, but the sqrt() adds strong nonlinearities to the cost
96 // function. Instead, a different cost is used, which while not strictly a
98 // robust fits when there are outliers. This is because the cost surface is
140 CostFunction *cost = local
143 problem.AddResidualBlock(cost, loss, &x, &y, &m);
/external/clang/utils/
H A DCmpDriver36 def cost(a, b): function in function:insertMinimumPadding
47 current = cost(a, b)
51 candidate = cost(a_0, b)
/external/libvpx/libvpx/vp8/encoder/
H A Dtreewriter.c14 static void cost( function
32 cost(C, T, P, j, d);
38 cost(c, t, p, 0, 0);
42 cost(c, t, p, start, 0);
/external/libvpx/libvpx/vp9/encoder/
H A Dvp9_treewriter.c13 static void cost(int *costs, vp9_tree tree, const vp9_prob *probs, function
25 cost(costs, tree, probs, ii, cc);
30 cost(costs, tree, probs, 0, 0);
37 cost(costs, tree, probs, 2, 0);
H A Dvp9_treewriter.h67 int cost = 0; local
72 cost += vp9_cost_bit(probs[i >> 1], bit);
76 return cost;
/external/ceres-solver/include/ceres/
H A Dgradient_checker.h32 // This file contains a class that exercises a cost function, to make sure
34 // computed by the cost function with those obtained by finite
53 // An object that exercises a cost function, to compare the answers that it
71 // Computed cost.
72 Vector cost; member in struct:ceres::GradientChecker::GradientCheckResults
74 // The sizes of these matrices are dictated by the cost function's
80 // Derivatives as computed by the cost function.
90 // Checks the Jacobian computed by a cost function.
97 // term: The cost function to test. Not retained after this call returns.
174 results->cost
[all...]
H A Diteration_callback.h50 cost(0.0),
94 double cost; member in struct:ceres::IterationSummary
108 // cost and the change in the cost of the linearized approximation.
190 // summary.cost,
/external/clang/test/CodeGenCXX/
H A Darray-operator-delete-call.cpp25 S *cost; member in struct:COST
36 cost = new S[3];
43 if (cost) {
44 delete [] cost;
/external/proguard/src/proguard/shrink/
H A DShortestUsageMark.java65 int cost,
68 this(previousUsageMark, reason, cost, clazz, null);
78 * @param cost the added cost of following this path.
82 int cost,
88 this.depth = previousUsageMark.depth + cost;
63 ShortestUsageMark(ShortestUsageMark previousUsageMark, String reason, int cost, Clazz clazz) argument
80 ShortestUsageMark(ShortestUsageMark previousUsageMark, String reason, int cost, Clazz clazz, Member member) argument
/external/srec/srec/ca/
H A Drec_nbes.c99 ESR_ReturnCode CA_NBestListGetResultWordIDs(CA_NBestList* nbest, size_t index, wordID* wordIDs, size_t* len, asr_int32_t* cost) argument
106 return srec_nbest_get_resultWordIDs(nbest, index, wordIDs, len, cost);
H A Drec_resu.c45 bigcostdata cost; local
47 srec_get_top_choice_score(hRecog->recm, &cost, do_incsil);
49 *score = cost;
/external/chromium_org/third_party/libwebp/enc/
H A Dcost.c14 #include "./cost.h"
21 // Boolean-cost cost table
53 // Level cost tables
342 int cost = 0; local
346 cost += VP8BitCost(bits & 1, probas[i]);
351 return cost;
373 // Starting at level 67 and up, the variable part of the cost is
382 // Mode cost tables.
384 // These are the fixed probabilities (in the coding trees) turned into bit-cost
[all...]
/external/eigen/bench/
H A DbenchCholesky.cpp34 int cost = 0; local
38 cost += 2*(r*j+r+j);
82 << "(" << 1e-6 * cost*repeats/timerNoSqrt.value() << " MFLOPS)\t"
84 << "(" << 1e-6 * cost*repeats/timerSqrt.value() << " MFLOPS)\n";
/external/webp/src/enc/
H A Dcost.c14 #include "./cost.h"
21 // Boolean-cost cost table
53 // Level cost tables
342 int cost = 0; local
346 cost += VP8BitCost(bits & 1, probas[i]);
351 return cost;
373 // Starting at level 67 and up, the variable part of the cost is
382 // Mode cost tables.
384 // These are the fixed probabilities (in the coding trees) turned into bit-cost
[all...]
/external/bzip2/
H A Dcompress.c256 UInt16 cost[BZ_N_GROUPS]; local
353 Calculate the cost of this group as coded
356 for (t = 0; t < nGroups; t++) cost[t] = 0;
383 cost[0] = cost01 & 0xffff; cost[1] = cost01 >> 16;
384 cost[2] = cost23 & 0xffff; cost[3] = cost23 >> 16;
385 cost[4] = cost45 & 0xffff; cost[5] = cost45 >> 16;
391 for (t = 0; t < nGroups; t++) cost[
[all...]

Completed in 362 milliseconds

1234