| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| H A D | org.eclipse.core.expressions_3.4.200.v20100505.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
| H A D | org.eclipse.help.base_3.5.2.v201011171123.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
| H A D | org.eclipse.ui.workbench_3.6.1.M20101117-0800.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
| H A D | org.eclipse.ui.ide_3.6.2.M20101117-0800.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
| /external/qemu/target-arm/ |
| H A D | helper.c | 2919 float32 product; local
2927 product = float32_mul(a, b, s);
2928 return float32_div(float32_sub(float32_three, product, s), float32_two, s);
|
| /external/v8/benchmarks/ |
| H A D | earley-boyer.js | 329 var product = 1;
331 product *= arguments[i];
332 return product;
|
| /external/webkit/PerformanceTests/SunSpider/tests/v8-v4/ |
| H A D | v8-earley-boyer.js | 323 var product = 1;
325 product *= arguments[i];
326 return product;
|
| /external/webkit/PerformanceTests/SunSpider/tests/v8-v5/ |
| H A D | v8-earley-boyer.js | 323 var product = 1;
325 product *= arguments[i];
326 return product;
|
| /external/webkit/PerformanceTests/SunSpider/tests/v8-v6/ |
| H A D | v8-earley-boyer.js | 323 var product = 1;
325 product *= arguments[i];
326 return product;
|
| /external/ceres-solver/docs/ |
| H A D | solving.tex | 332 The cost of forming and storing the Schur complement $S$ can be prohibitive for large problems. Indeed, for an inexact Newton solver that computes $S$ and runs PCG on it, almost all of its time is spent in constructing $S$; the time spent inside the PCG algorithm is negligible in comparison. Because PCG only needs access to $S$ via its product with a vector, one way to evaluate $Sx$ is to observe that
349 The computational cost of using a preconditioner $M$ is the cost of computing $M$ and evaluating the product $M^{-1}y$ for arbitrary vectors $y$. Thus, there are two competing factors to consider: How much of $H$'s structure is captured by $M$ so that the condition number $\kappa(HM^{-1})$ is low, and the computational cost of constructing and using $M$. The ideal preconditioner would be one for which $\kappa(M^{-1}A) =1$. $M=A$ achieves this, but it is not a practical choice, as applying this preconditioner would require solving a linear system equivalent to the unpreconditioned problem. It is usually the case that the more information $M$ has about $H$, the more expensive it is use. For example, Incomplete Cholesky factorization based preconditioners have much better convergence behavior than the Jacobi preconditioner, but are also much more expensive.
|
| H A D | modeling.tex | 374 side is the standard quaternion product. \texttt{QuaternionParameterization} is an implementation of~\eqref{eq:quaternion}.
|
| /external/llvm/bindings/ocaml/llvm/ |
| H A D | llvm.mli | 859 (** [const_mul c1 c2] returns the constant product of two constants.
863 (** [const_nsw_mul c1 c2] returns the constant product of two constants with
868 (** [const_nuw_mul c1 c2] returns the constant product of two constants with
873 (** [const_fmul c1 c2] returns the constant product of two constants floats.
|
| /external/zxing/core/ |
| H A D | core.jar | META-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/zxing/ com/google/zxing/aztec/ ... |
| /external/dropbear/libtommath/ |
| H A D | bn.tex | 1157 Which assigns the full signed product $ab$ to $c$. This function actually breaks into one of four cases which are
|
| /external/iproute2/doc/ |
| H A D | ip-cref.tex | 2648 http://www.cisco.com/univercd/cc/td/doc/product/software/ios120.
2660 http://www.cisco.com/univercd/cc/td/doc/product/software/ios120.
|
| /external/qemu-pc-bios/bochs/bios/ |
| H A D | rombios.c | 2108 /* print product string if BEV */
10284 ;; Found a device that thinks it can boot the system. Record its BEV and product name string.
10285 mov di, 0x10[bx] ;; Pointer to the product name string or zero if none
|
| /external/dropbear/libtomcrypt/ |
| H A D | crypt.tex | 3229 The system begins with with two primes $p$ and $q$ and their product $N = pq$. The order or \textit{Euler totient} of the
|