- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 781 for iterations (0.33 sec)
-
cmd/prepare-storage.go
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Sun May 19 08:06:49 UTC 2024 - 11.1K bytes - Viewed (0) -
src/math/big/natdiv.go
For a 2n-digit number divided by an n-digit number (the worst size-n case for division complexity), this algorithm uses n+1 iterations, each of which must do at least the 1-by-n-digit multiplication q̂·v. That's O(n) iterations of O(n) time each, so O(n²) time overall. Recursive Division For very large inputs, it is possible to improve on the O(n²) algorithm.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 14 17:02:38 UTC 2024 - 34.4K bytes - Viewed (0) -
tensorflow/compiler/jit/flags.cc
"(experimental) " "Limit the operations clustered by XLA to these operations. " "If multiple, separate them with commas. Shortcuts: " " PW: All point-wise operations." " RED: All reduction operations." " MISC: Mixed operations." " PWRED: TF operations that get converted to PW+RED operation in XLA." " REDUCEWINDOW: TF operations like MaxPool/AvgPool that get "
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Apr 17 18:52:57 UTC 2024 - 24.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/ExecutionSequencerTest.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Feb 13 14:28:25 UTC 2024 - 16.8K bytes - Viewed (0) -
tensorflow/compiler/mlir/tfrt/ir/mlrt/tf_mlrt_ops.td
let summary = "Asynchronously execution of while op for tf_mlrt"; let description = [{ cond: The boolean to control whether the first iteration should be executed. arguments: the last $immutable_size elements are invariants between iterations. results: a list of futures.
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri May 31 20:44:15 UTC 2024 - 13.6K bytes - Viewed (0) -
android/guava/src/com/google/common/math/BigIntegerMath.java
* with each iteration, so this algorithm takes O(log(digits)) iterations. * * We start out with a double-precision approximation, which may be higher or lower than the * true value. Therefore, we perform at least one Newton iteration to get a guess that's * definitely >= floor(sqrt(x)), and then continue the iteration until we reach a fixed point. */ BigInteger sqrt0; int log2 = log2(x, FLOOR);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 18.9K bytes - Viewed (0) -
subprojects/composite-builds/src/integTest/groovy/org/gradle/integtests/composite/CompositeBuildPluginDevelopmentIntegrationTest.groovy
} """ when: args "--configure-on-demand", "--parallel" execute(buildA, ":c:resolve", ":d:resolve") then: noExceptionThrown() where: iterations << (0..20).collect() } @Issue("https://github.com/gradle/gradle/issues/15068") def "can develop plugin whose build requires dependency resolution using configure-on-demand"() { given:
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Tue Mar 26 13:37:31 UTC 2024 - 23.1K bytes - Viewed (0) -
src/testing/fuzz.go
fmt.Fprintf(f.w, "To re-run:\ngo test -run=%s/%s\n", f.name, testName) } } // TODO(jayconrod,katiehockman): Aggregate statistics across workers // and add to FuzzResult (ie. time taken, num iterations) case fuzzWorker: // Fuzzing is enabled, and this is a worker process. Follow instructions // from the coordinator. if err := f.fuzzContext.deps.RunFuzzWorker(func(e corpusEntry) error {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Apr 26 22:55:25 UTC 2024 - 22.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/OrderingTest.java
runLeastOfComparison(10, 30, 2); } private static void runLeastOfComparison(int iterations, int elements, int seeds) { Random random = new Random(42); Ordering<Integer> ordering = Ordering.natural(); for (int i = 0; i < iterations; i++) { List<Integer> list = Lists.newArrayList(); for (int j = 0; j < elements; j++) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Mar 07 18:34:03 UTC 2024 - 42.5K bytes - Viewed (0) -
guava/src/com/google/common/math/BigIntegerMath.java
* with each iteration, so this algorithm takes O(log(digits)) iterations. * * We start out with a double-precision approximation, which may be higher or lower than the * true value. Therefore, we perform at least one Newton iteration to get a guess that's * definitely >= floor(sqrt(x)), and then continue the iteration until we reach a fixed point. */ BigInteger sqrt0; int log2 = log2(x, FLOOR);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 18.9K bytes - Viewed (0)