- Sort Score
- Result 10 results
- Languages All
Results 61 - 70 of 299 for fecero (0.11 sec)
-
tensorflow/c/experimental/saved_model/core/tf_concrete_function_loading_test.cc
context(), &result); EXPECT_EQ(status.code(), error::FAILED_PRECONDITION) << status.message(); } // A SavedConcreteFunction whose outputs are fewer than its corresponding // functiondef should cause an error. TEST_F(SavedConcreteFunctionLoadingTest, TooFewOutputsInSavedConcreteFunction) { // `saved` has 0 inputs, 1 output SavedConcreteFunction saved;
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri Apr 14 19:16:58 UTC 2023 - 10.6K bytes - Viewed (0) -
src/hash/crc32/crc32_amd64.s
// // func castagnoliSSE42(crc uint32, p []byte) uint32 TEXT ·castagnoliSSE42(SB),NOSPLIT,$0 MOVL crc+0(FP), AX // CRC value MOVQ p+8(FP), SI // data pointer MOVQ p_len+16(FP), CX // len(p) // If there are fewer than 8 bytes to process, skip alignment. CMPQ CX, $8 JL less_than_8 MOVQ SI, BX ANDQ $7, BX JZ aligned // Process the first few bytes to 8-byte align the input.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 01 21:52:00 UTC 2018 - 5.4K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/util/flowcontrol/fairqueuing/queueset/doc.go
// respect to t is // // 1 / NEQ(t) . // // To generalize from transmitting one packet at a time to executing C // requests at a time, that derivative becomes // // C / NEQ(t) . // // However, sometimes there are fewer than C requests available to // execute. For a given queue "q", let us also write "reqs(q, t)" for // the number of requests of that queue that are executing at that // time. The total number of requests executing is sum[over q]
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Feb 08 12:33:30 UTC 2024 - 6.1K bytes - Viewed (0) -
src/crypto/internal/edwards25519/scalarmult.go
// magnitude up to 2^{w-1} so that the nonzero digits are as // sparse as possible. Intuitively, this "condenses" the // "mass" of the scalar onto sparse coefficients (meaning // fewer additions). basepointNafTable := basepointNafTable() var aTable nafLookupTable5 aTable.FromP3(A) // Because the basepoint is fixed, we can use a wider NAF // corresponding to a bigger table.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 05 21:53:10 UTC 2022 - 6.3K bytes - Viewed (0) -
platforms/core-runtime/messaging/src/test/groovy/org/gradle/internal/event/ListenerBroadcastTest.groovy
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Sep 22 08:59:22 UTC 2023 - 9.4K bytes - Viewed (0) -
tensorflow/compiler/mlir/quantization/tensorflow/passes/prepare_quantize_drq.cc
op->emitRemark("Quantization is skipped for ") << quantized_op->getName().getStringRef().str() << " because it has " << mlir::dyn_cast<DenseFPElementsAttr>(attr).size() << " elements which is fewer than the threshold(" << quant_specs_.minimum_elements_for_weights << " elements)."; return false; } if (is_per_channel_quantization) { quant_type = mlir::dyn_cast<quant::QuantizedType>(
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 11.5K bytes - Viewed (0) -
src/math/big/decimal.go
} // not halfway - digit tells all (x.mant has no trailing zeros) return x.mant[n] >= '5' } // round sets x to (at most) n mantissa digits by rounding it // to the nearest even value with n (or fever) mantissa digits. // If n < 0, x remains unchanged. func (x *decimal) round(n int) { if n < 0 || n >= len(x.mant) { return // nothing to do } if shouldRoundUp(x, n) { x.roundUp(n) } else {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 29 22:45:29 UTC 2020 - 6.6K bytes - Viewed (0) -
src/net/resolverdialfunc_test.go
if err != nil { panic(err) } } type SRVWriter struct{ ResponseWriter } // AddSRV adds a SRV record. The target name must end in a period and // be 63 bytes or fewer. func (w SRVWriter) AddSRV(priority, weight, port uint16, target string) error { targetName, err := dnsmessage.NewName(target) if err != nil { return err } w.a.wrote = true
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 8.3K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/remove_unused_arguments.cc
if (!argument_to_index.count(r.get())) continue; int arg = argument_to_index.lookup(r.get()); // If we see an arg as a result, and we're going // to remove that result, we can assume one fewer use. use_count[arg]--; return_to_operand.insert({i, arg}); unused_results.set(i); } // Now mark all args for deletion that don't have uses anymore.
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 8.9K bytes - Viewed (0) -
platforms/documentation/docs/src/docs/userguide/optimizing-performance/build-cache/build_cache_use_cases.adoc
This translates into faster feedback for developers, and less money spent on the CI resources. Faster builds also mean fewer commits being part of each build, which makes debugging issues more efficient. Beginning with the build cache on CI is a good first step as the environment on CI agents is usually more stable and predictable than developer machines.
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon Nov 27 17:53:42 UTC 2023 - 6K bytes - Viewed (0)