- Sort Score
- Result 10 results
- Languages All
Results 1 - 7 of 7 for max_iterations_ (0.28 sec)
-
tensorflow/compiler/mlir/tfrt/tests/mlrt/async_while.mlir
// CHECK-LABEL: func.func private @"map/while_cond" func.func private @"map/while_cond"(%loop_count: tensor<i32>, %max_iterations: tensor<i32>, %handle: tensor<?x!tf_type.resource>, %flow_in: tensor<*xf32>, %matrix: tensor<3x3xf32>) -> tensor<i1> { %0 = "tf.Less"(%loop_count, %max_iterations) : (tensor<i32>, tensor<i32>) -> tensor<i1> return %0 : tensor<i1> }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Mon Oct 30 06:52:55 UTC 2023 - 22.2K bytes - Viewed (0) -
tensorflow/compiler/mlir/tfrt/ir/mlrt/tf_mlrt_ops.td
The Pmap executes body function in parallel for all ranges up to $max_iterations. The pseudo code: for(int i = 0; i < $max_iterations; i++) { body_fn(MlrtFture($tensor_list_or_flow_in[i]), MlrtPromise($tensor_list_or_flow_in[i+1]), i, i, $invariant_args); } return $tensor_list_or_flow_in[$max_iterations] }]; let arguments = (ins
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri May 31 20:44:15 UTC 2024 - 13.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/TopKSelector.java
int minThresholdPosition = 0; // The leftmost position at which the greatest of the k lower elements // -- the new value of threshold -- might be found. int iterations = 0; int maxIterations = IntMath.log2(right - left, RoundingMode.CEILING) * 3; while (left < right) { int pivotIndex = (left + right + 1) >>> 1; int pivotNewIndex = partition(left, right, pivotIndex);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 11.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TopKSelector.java
int minThresholdPosition = 0; // The leftmost position at which the greatest of the k lower elements // -- the new value of threshold -- might be found. int iterations = 0; int maxIterations = IntMath.log2(right - left, RoundingMode.CEILING) * 3; while (left < right) { int pivotIndex = (left + right + 1) >>> 1; int pivotNewIndex = partition(left, right, pivotIndex);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 11.2K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/cluster_ops_by_policy.cc
// Run clustering passes until the convergence. Limit the number of iterations // to guard from the infinite loop in presence of bugs. constexpr int max_iterations = 100; for (unsigned i = 0; i < max_iterations; ++i) if (!RunClusteringPass(state, policies)) break; // Form clusters found by the union-find algorithm. llvm::DenseMap<unsigned, Cluster> root_clusters;
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 27.9K bytes - Viewed (0) -
pkg/controller/statefulset/stateful_set_test.go
om.setsIndexer.Add(set) ssc.enqueueStatefulSet(set) fakeWorker(ssc) selector, err := metav1.LabelSelectorAsSelector(set.Spec.Selector) if err != nil { return err } iterations := 0 for (maxIterations < 0 || iterations < maxIterations) && set.Status.ReadyReplicas < *set.Spec.Replicas { iterations++
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sat May 04 18:33:12 UTC 2024 - 33.1K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/transforms/legalize_tf.cc
// Look if there is a function that tries until it converge. // Currently unit-test doesn't do multiple tries, so we need this. const int max_iterations = 15; for (int i = 0; i < max_iterations; ++i) { if (failed(applyPartialConversion(func, target, frozenPatterns))) { return false; } } return true; } void LegalizeTFPass::runOnOperation() {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Mon May 20 20:06:54 UTC 2024 - 45.2K bytes - Viewed (0)