OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
full:solver
(Results
501 - 525
of
535
) sorted by null
<<
21
22
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/centrality/
katz.py
240
This algorithm uses a direct linear
solver
to solve the above equation.
/external/ceres-solver/cmake/
FindSuiteSparse.cmake
1
# Ceres
Solver
- A fast non-linear least squares minimizer
3
# http://code.google.com/p/ceres-
solver
/
/external/ceres-solver/include/ceres/
cost_function_to_functor.h
1
// Ceres
Solver
- A fast non-linear least squares minimizer
3
// http://code.google.com/p/ceres-
solver
/
rotation.h
1
// Ceres
Solver
- A fast non-linear least squares minimizer
3
// http://code.google.com/p/ceres-
solver
/
jet.h
1
// Ceres
Solver
- A fast non-linear least squares minimizer
3
// http://code.google.com/p/ceres-
solver
/
/external/ceres-solver/internal/ceres/
autodiff_test.cc
1
// Ceres
Solver
- A fast non-linear least squares minimizer
3
// http://code.google.com/p/ceres-
solver
/
compressed_row_sparse_matrix.cc
1
// Ceres
Solver
- A fast non-linear least squares minimizer
3
// http://code.google.com/p/ceres-
solver
/
covariance_impl.cc
1
// Ceres
Solver
- A fast non-linear least squares minimizer
3
// http://code.google.com/p/ceres-
solver
/
covariance_test.cc
1
// Ceres
Solver
- A fast non-linear least squares minimizer
3
// http://code.google.com/p/ceres-
solver
/
dynamic_autodiff_cost_function_test.cc
1
// Ceres
Solver
- A fast non-linear least squares minimizer
3
// http://code.google.com/p/ceres-
solver
/
schur_eliminator_impl.h
1
// Ceres
Solver
- A fast non-linear least squares minimizer
3
// http://code.google.com/p/ceres-
solver
/
visibility_based_preconditioner.cc
1
// Ceres
Solver
- A fast non-linear least squares minimizer
3
// http://code.google.com/p/ceres-
solver
/
rotation_test.cc
1
// Ceres
Solver
- A fast non-linear least squares minimizer
3
// http://code.google.com/p/ceres-
solver
/
[
all
...]
problem_test.cc
1
// Ceres
Solver
- A fast non-linear least squares minimizer
3
// http://code.google.com/p/ceres-
solver
/
[
all
...]
/external/eigen/Eigen/src/UmfPackSupport/
UmfPackSupport.h
121
* \brief A sparse LU factorization and
solver
based on UmfPack
/cts/suite/cts/deviceTests/browserbench/assets/octane/
deltablue.js
35
* "The DeltaBlue Algorithm: An Incremental Constraint Hierarchy
Solver
"
538
* constraint
solver
.
/external/eigen/Eigen/src/SuperLUSupport/
SuperLUSupport.h
468
* \brief A sparse direct LU factorization and
solver
based on the SuperLU library
808
* \brief A sparse direct \b incomplete LU factorization and
solver
based on the SuperLU library
/external/llvm/lib/CodeGen/
RegAllocPBQP.cpp
13
// solving this using a PBQP
solver
, and mapping the solution back to a
17
// The PBQP
solver
(pbqp.c) provided for this allocator uses a heuristic tuned
/external/v8/benchmarks/
deltablue.js
35
* "The DeltaBlue Algorithm: An Incremental Constraint Hierarchy
Solver
"
535
* constraint
solver
.
/external/apache-commons-math/src/main/java/org/apache/commons/math/linear/
AbstractRealMatrix.java
37
/** Cached LU
solver
.
[
all
...]
/external/eigen/Eigen/src/LU/
FullPivLU.h
607
// ok, we have our trapezoid matrix, we can apply the triangular
solver
.
/external/llvm/include/llvm/CodeGen/
RegAllocPBQP.h
178
/// \brief Holds
solver
state and other metadata relevant to each PBQP RA node.
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/
test_generators.py
1036
#
solver
below, the number of backtracking levels can be enormous (one
1080
# A conjoin-based N-Queens
solver
.
1132
# A conjoin-based Knight's Tour
solver
. This is pretty sophisticated
[
all
...]
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/
test_generators.py
1036
#
solver
below, the number of backtracking levels can be enormous (one
1080
# A conjoin-based N-Queens
solver
.
1132
# A conjoin-based Knight's Tour
solver
. This is pretty sophisticated
[
all
...]
/external/clang/www/analyzer/
checker_dev_manual.html
225
solver
to model symbolic execution.</li>
Completed in 992 milliseconds
<<
21
22