Home
last modified time | relevance | path

Searched full:solutions (Results 1 – 25 of 722) sorted by relevance

12345678910>>...29

/external/pytorch/aten/src/ATen/cuda/tunable/
DGemmRocblas.h177 // Get the number of available solutions in GetRocBlasGemmTypeStringAndOps()
185 std::vector<int> solutions(solution_size); in GetRocBlasGemmTypeStringAndOps()
186 // Get the list of available solutions in GetRocBlasGemmTypeStringAndOps()
192 solutions.data(), in GetRocBlasGemmTypeStringAndOps()
194 // Sort the solutions in ascending order to make the solution vector deterministic across runs in GetRocBlasGemmTypeStringAndOps()
195 std::sort(solutions.begin(), solutions.end()); in GetRocBlasGemmTypeStringAndOps()
198 for (size_t i = 0; i < solutions.size(); ++i) { in GetRocBlasGemmTypeStringAndOps()
199 auto callable = std::make_unique<RocblasGemmOp<T>>(solutions[i]); in GetRocBlasGemmTypeStringAndOps()
200 ret.emplace_back(std::make_pair(c10::str("Gemm_Rocblas_", solutions[i]), std::move(callable))); in GetRocBlasGemmTypeStringAndOps()
247 // Get the number of available solutions in GetRocBlasGemmStridedBatchedTypeStringAndOps()
[all …]
/external/apache-commons-math/src/main/java/org/apache/commons/math3/analysis/solvers/
DAllowedSolution.java21 /** The kinds of solutions that a {@link BracketedUnivariateSolver
22 * (bracketed univariate real) root-finding algorithm} may accept as solutions.
26 * <p>If all solutions are accepted ({@link #ANY_SIDE}), then the solution
41 /** There are no additional side restriction on the solutions for
49 /** Only solutions that are less than or equal to the actual root are
50 * acceptable as solutions for root-finding. In other words,
56 /** Only solutions that are greater than or equal to the actual root are
57 * acceptable as solutions for root-finding. In other words,
63 /** Only solutions for which values are less than or equal to zero are
64 * acceptable as solutions for root-finding. So, if a function f(x) has
[all …]
DBracketedUnivariateSolver.java33 * {@link AllowedSolution allowed solutions}. Other root-finding
40 * solutions.</p>
59 * @param allowedSolution The kind of solutions that the root-finding algorithm may
60 * accept as solutions.
81 * @param allowedSolution The kind of solutions that the root-finding algorithm may
82 * accept as solutions.
DBracketedRealFieldUnivariateSolver.java34 * {@link AllowedSolution allowed solutions}. Other root-finding
41 * solutions.</p>
67 * Get the absolute accuracy of the solver. Solutions returned by the
109 * @param allowedSolution The kind of solutions that the root-finding algorithm may
110 * accept as solutions.
131 * @param allowedSolution The kind of solutions that the root-finding algorithm may
132 * accept as solutions.
/external/mesa3d/src/panfrost/util/
Dlcra.c59 l->solutions = calloc(sizeof(l->solutions[0]), node_count); in lcra_alloc_equations()
61 memset(l->solutions, ~0, sizeof(l->solutions[0]) * node_count); in lcra_alloc_equations()
80 free(l->solutions); in lcra_free()
140 lcra_test_linear(struct lcra_state *l, unsigned *solutions, unsigned i) in lcra_test_linear() argument
143 signed constant = solutions[i]; in lcra_test_linear()
146 if (solutions[j] == ~0) in lcra_test_linear()
149 signed lhs = solutions[j] - constant; in lcra_test_linear()
165 if (l->solutions[step] != ~0) in lcra_solve()
186 l->solutions[step] = ((m * P + n) << shift) + class_start; in lcra_solve()
187 succ = lcra_test_linear(l, l->solutions, step); in lcra_solve()
Dlcra.h60 * biased to all solutions in the class. */
68 /* Before solving, forced registers; after solving, solutions. */
69 unsigned *solutions; member
/external/fonttools/Lib/fontTools/pens/
DpointInsidePen.py120 solutions = sorted(solveCubic(ay, by, cy, dy - y))
121 solutions = [t for t in solutions if -0.0 <= t <= 1.0]
122 if not solutions:
132 for t in solutions:
176 solutions = sorted(solveQuadratic(a, b, c - y))
177 solutions = [
178 t for t in solutions if ZERO_MINUS_EPSILON <= t <= ONE_PLUS_EPSILON
180 if not solutions:
/external/rust/android-crates-io/crates/spdx/src/text/exceptions/
DDigiRule-FOSS-exception1 r#"DigiRule Solutions’s FOSS License Exception Terms and Conditions
9 …DigiRule Solutions in a copy of the Client Libraries stating that such copy of the Client Librarie…
13 “Program” means a copy of DigiRule Solutions’s Client Libraries that contain a FOSS Notice.
27 3. DigiRule Solutions reserves all rights not expressly granted in these terms and conditions. If a…
/external/mesa3d/src/panfrost/compiler/
Dbi_ra.c48 /* Before solving, forced registers; after solving, solutions. */
49 unsigned *solutions; member
69 l->solutions = calloc(sizeof(l->solutions[0]), node_count); in lcra_alloc_equations()
72 memset(l->solutions, ~0, sizeof(l->solutions[0]) * node_count); in lcra_alloc_equations()
85 free(l->solutions); in lcra_free()
121 lcra_test_linear(struct lcra_state *l, unsigned *solutions, unsigned i) in lcra_test_linear() argument
123 signed constant = solutions[i]; in lcra_test_linear()
130 if (solutions[j] == ~0) in lcra_test_linear()
133 signed lhs = constant - solutions[j]; in lcra_test_linear()
148 if (solutions[j] == ~0) in lcra_test_linear()
[all …]
/external/libconfig/debian/
Dchangelog7 -- Jose Luis Tallon <jltallon@adv-solutions.net> Thu, 31 Dec 2015 17:01:20 +0100
126 -- Jose Luis Tallon <jltallon@adv-solutions.net> Sun, 13 Sep 2009 04:25:14 +0200
134 -- Jose Luis Tallon <jltallon@adv-solutions.net> Tue, 07 Apr 2009 21:13:16 +0200
152 -- Jose Luis Tallon <jltallon@adv-solutions.net> Fri, 31 Oct 2008 22:13:47 +0100
161 -- Jose Luis Tallon <jltallon@adv-solutions.net> Mon, 20 Jul 2008 19:55:23 +0200
167 -- Jose Luis Tallon <jltallon@adv-solutions.net> Mon, 2 Jul 2007 02:01:40 +0200
173 -- Jose Luis Tallon <jltallon@adv-solutions.net> Tue, 10 Oct 2006 01:42:09 +0200
Dcopyright1 This package was debianized by Jose Luis Tallon <jltallon@adv-solutions.net> on
35 copyright 2006-2009, Jose Luis Tallon <jltallon@adv-solutions.net>,
/external/eigen/doc/
DWrongStackAlignment.dox22 …nalignedArrayAssert "assertion on unaligned arrays". So far we found the three following solutions.
35 …as to be done for every such function, so you may prefer one of the following two global solutions.
38 \section sec_sol2 Global solutions
52 These global solutions are easy to use, but note that they may slowdown your program because they l…
/external/bazelbuild-rules_python/gazelle/python/testdata/invalid_imported_module/
Dtest.yaml21 …15: multiple targets (//foo:bar_1, //foo:bar_2) may be imported with "foo.bar": possible solutions:
25 "__init__.py", line 15: "foo" is an invalid dependency: possible solutions:
32 "__init__.py", line 18: "grpc" is an invalid dependency: possible solutions:
/external/python/bumble/bumble/
Dcompany_ids.py124 0x0066: "9Solutions Oy",
165 0x008F: "Telit Wireless Solutions GmbH",
284 0x0106: "Innovative Yachtter Solutions",
299 0x0115: "e.solutions",
317 0x0127: "Salutica Allied Solutions",
465 0x01BB: "Cochlear Bone Anchored Solutions AB",
508 0x01E6: "Technology Solutions (UK) Ltd",
584 0x0232: "x-Senso Solutions Kft",
611 0x024D: "M-Way Solutions GmbH",
645 0x026F: "Aptcode Solutions",
[all …]
/external/skia/src/base/
DSkCubics.h19 * Puts up to 3 real solutions to the equation
27 * Puts up to 3 real solutions to the equation
37 * Puts up to 3 real solutions to the equation
/external/apache-commons-math/src/main/java/org/apache/commons/math3/linear/
DDecompositionSolver.java29 * solvers can also find solutions with non-square matrix A and with non-null minimal norm. If an
80 * \( A x = b \) may have no solutions, or many. If it has no solutions, then the pseudo-inverse
82 * \|_2 \) is minimized. If there are many solutions, then \( z = A^+ b \) is the smallest
/external/apache-commons-math/src/main/java/org/apache/commons/math3/dfp/
DBracketingNthOrderBrentSolverDFP.java104 * @param allowedSolution The kind of solutions that the root-finding algorithm may accept as
105 * solutions.
130 * @param allowedSolution The kind of solutions that the root-finding algorithm may accept as
131 * solutions.
/external/google-cloud-java/java-gsuite-addons/proto-google-apps-script-type-protos/src/main/java/com/google/apps/script/type/calendar/
DCalendarAddOnManifestOrBuilder.java80 * Defines conference solutions provided by this add-on.
92 * Defines conference solutions provided by this add-on.
103 * Defines conference solutions provided by this add-on.
114 * Defines conference solutions provided by this add-on.
126 * Defines conference solutions provided by this add-on.
/external/google-cloud-java/java-retail/
D.repo-metadata.json4 "product_documentation": "https://cloud.google.com/solutions/retail",
5 "api_description": "Retail solutions API.",
/external/pytorch/torch/distributed/tensor/
DREADME.md28 …solutions have been built independently (i.e. PyTorch DDP, FSDP, ShardedTensor, PiPPy, etc.). When…
30 …out worrying about how to do distributed training in a cluster, and our solutions could help them …
147 …solutions for cases like Tensor Parallelism. But when using the DTensor's replication in a data pa…
153 …“distributed tensor” concept for both replication and sharding, and the solutions could enable use…
/external/tink/.github/ISSUE_TEMPLATE/
Dfeature_request.md21 **Have you considered any alternative solutions?**
23 Provide an explanation of any alternate requests or solutions and why your
/external/google-cloud-java/java-private-catalog/
D.repo-metadata.json5 …cloud admins to make their solutions discoverable to their internal enterprise users. Cloud admins…
/external/google-cloud-java/java-cloudcommerceconsumerprocurement/
D.repo-metadata.json5 …solutions integrated with Google Cloud to accelerate your digital transformation. Scale and simpli…
/external/googleapis/google/cloud/privatecatalog/
DBUILD.bazel30 …loud admins can make their solutions discoverable to their internal enterprise users. Cloud admins…
/external/pytorch/aten/src/ATen/native/miopen/
DConv_miopen.cpp390 miopenConvSolution_t solutions[AT_MIOPEN_MAX_SOLUTIONS]; in getSolution() local
409 solutions)); in getSolution()
414 if (solutions[i].algorithm == (miopenConvAlgorithm_t)DEFAULT_ALGO) { in getSolution()
415 return solutions[i]; in getSolution()
420 if (solutions[i].workspace_size == 0) { in getSolution()
421 return solutions[i]; in getSolution()
427 return solutions[0]; in getSolution()
463 miopenConvSolution_t solutions[AT_MIOPEN_MAX_SOLUTIONS]; in getSolution() local
482 solutions)); in getSolution()
487 if (solutions[i].algorithm == (miopenConvAlgorithm_t)DEFAULT_ALGO) { in getSolution()
[all …]

12345678910>>...29