HomeSort by relevance Sort by last modified time
    Searched refs:Consider (Results 1 - 15 of 15) sorted by null

  /external/chromium/chrome/browser/resources/net_internals/
loggrouper.js 75 // Consider this as the terminator for all open BEGINs up until
  /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/tool/templates/messages/languages/
en.stg 261 ANTLR could not analyze this decision in rule <enclosingRule>; often this is because of recursive rule references visible from the left edge of alternatives. ANTLR will re-analyze the decision with a fixed lookahead of k=1. Consider using "options {k=1;}" for that decision and possibly adding a syntactic predicate.
  /external/ceres-solver/docs/
powell.tex 4 Consider now a slightly more complicated example -- the minimization of Powell's function. Let $x = \left[x_1, x_2, x_3, x_4 \right]$ and
62 and \texttt{F4}. Then let us consider the construction and solution of the problem. For brevity we only describe the relevant bits of code~\footnote{The full source code for this example can be found in \texttt{examples/powell.cc}.}
modeling.tex 78 For example, consider a scalar error $e = k - x^\top y$, where both $x$ and $y$ are
175 twice as many function evaluations than forward difference. Consider using
185 Consider a structure from motion problem. The unknowns are 3D
261 Let us consider a problem with a single problem and a single parameter
solving.tex 123 the way the trust region step is computed. e.g., consider the
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.
387 parameter blocks as it chooses. e.g. Consider the linear system
    [all...]
  /external/libvorbis/doc/
07-floor1.tex 48 Consider the following example, with values chosen for ease of
  /ndk/
ndk-gdb.py 620 Consider using --start or --launch=<name> if not.''')
  /external/clang/tools/scan-build/
scan-build 65 Diag ("Please consider submitting a bug report using these files:\n");
820 print OUT "<p>Please consider submitting preprocessed files as <a href=\"http://clang-analyzer.llvm.org/filing_bugs.html\">bug reports</a>. <!-- REPORTCRASHES --> </p>\n";
    [all...]
  /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/
BaseRecognizer.as 371 * Consider grammar:
404 * For error recovery, we cannot consider FOLLOW(c)
465 * For example, consider grammar:
  /external/icu4c/common/unicode/
urename.h 50 #error U_ICU_ENTRY_POINT_RENAME is not defined - cannot continue. Consider defining U_DISABLE_RENAMING if renaming should not be used.
    [all...]
  /external/mksh/src/
Build.sh     [all...]
  /external/bison/
maint.mk 525 # Consider these symbols:
    [all...]
  /build/tools/droiddoc/templates-sdk/assets/js/
docs.js     [all...]
  /external/dropbear/libtommath/
bn.tex     [all...]
  /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/
Antlr.Runtime.pas     [all...]

Completed in 528 milliseconds