- Sort Score
- Result 10 results
- Languages All
Results 101 - 110 of 412 for Computation (0.16 sec)
-
tensorflow/c/eager/tape.h
// `forward_function` is null, a GradientTape is used on the backward function // to compute the jvp, which will waste computation when executing eagerly. // // Unlike GradientTape::RecordOperation, Accumulate runs gradient computation // immediately. It stores the results, which feed into Accumulate for future // operations and may be fetched by calling FetchJVP. ForwardAccumulator
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Apr 02 12:40:29 UTC 2024 - 47.2K bytes - Viewed (0) -
tensorflow/c/eager/parallel_device/parallel_device_lib.h
// A non-blocking version of `Execute`. After each call, `Join` must be called // before `StartExecute` is called again. Using `StartExecute` with `Join` // allows the caller to schedule computation on multiple ParallelDevices // without sequencing those operations (first call `StartExecute` on each // parallel device, then call `Join` on each; even if some of the `Join`s
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Apr 25 15:21:13 UTC 2023 - 12.9K bytes - Viewed (0) -
guava/src/com/google/common/math/Quantiles.java
public final class Quantiles { /** Specifies the computation of a median (i.e. the 1st 2-quantile). */ public static ScaleAndIndex median() { return scale(2).index(1); } /** Specifies the computation of quartiles (i.e. 4-quantiles). */ public static Scale quartiles() { return scale(4); } /** Specifies the computation of percentiles (i.e. 100-quantiles). */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 12 17:02:53 UTC 2023 - 29.9K bytes - Viewed (0) -
tensorflow/compiler/mlir/tf2xla/api/v1/compile_mlir_util.cc
// TODO(ycao): Support tensorlist-type output. out_desc.is_tensor_list = false; } // XLA computation always uses Tuple shape. *xla_output_shape = xla::ShapeUtil::MakeTupleShape(shapes); return absl::OkStatus(); } // Creates a vector that maps from the parameters of the XLA computation to // their original argument positions. // MLIR-based TF-Compiler bridge doesn't have constant analysis yet, thus no
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue May 21 17:24:39 UTC 2024 - 45.3K bytes - Viewed (0) -
tensorflow/compiler/jit/pjrt_device_compiler_client.cc
const XlaCompiler::CompilationResult& result) { VLOG(2) << "Compiling to xla::PjRtLoadedExecutable."; TF_ASSIGN_OR_RETURN(auto executable, client_->Compile(*result.computation, GetPjRtCompileOptions(options, result))); VLOG(2) << "Compiled PJRT executable " << executable->name() << " num_replicas " << executable->num_replicas()
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Feb 21 12:19:41 UTC 2024 - 3.6K bytes - Viewed (0) -
src/crypto/sha256/sha256block.go
func blockGeneric(dig *digest, p []byte) { var w [64]uint32 h0, h1, h2, h3, h4, h5, h6, h7 := dig.h[0], dig.h[1], dig.h[2], dig.h[3], dig.h[4], dig.h[5], dig.h[6], dig.h[7] for len(p) >= chunk { // Can interlace the computation of w with the // rounds below if needed for speed. for i := 0; i < 16; i++ { j := i * 4 w[i] = uint32(p[j])<<24 | uint32(p[j+1])<<16 | uint32(p[j+2])<<8 | uint32(p[j+3]) } for i := 16; i < 64; i++ {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 03 21:21:42 UTC 2023 - 2.4K bytes - Viewed (0) -
src/math/big/prime.go
// // References: // // Baillie and Wagstaff, "Lucas Pseudoprimes", Mathematics of Computation 35(152), // October 1980, pp. 1391-1417, especially page 1401. // https://www.ams.org/journals/mcom/1980-35-152/S0025-5718-1980-0583518-6/S0025-5718-1980-0583518-6.pdf // // Grantham, "Frobenius Pseudoprimes", Mathematics of Computation 70(234), // March 2000, pp. 873-891.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Nov 02 14:43:52 UTC 2022 - 10.4K bytes - Viewed (0) -
src/cmd/internal/notsha256/sha256block.go
func blockGeneric(dig *digest, p []byte) { var w [64]uint32 h0, h1, h2, h3, h4, h5, h6, h7 := dig.h[0], dig.h[1], dig.h[2], dig.h[3], dig.h[4], dig.h[5], dig.h[6], dig.h[7] for len(p) >= chunk { // Can interlace the computation of w with the // rounds below if needed for speed. for i := 0; i < 16; i++ { j := i * 4 w[i] = uint32(p[j])<<24 | uint32(p[j+1])<<16 | uint32(p[j+2])<<8 | uint32(p[j+3]) } for i := 16; i < 64; i++ {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Apr 29 14:23:17 UTC 2022 - 2.5K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/HashingOutputStream.java
* * <p>The {@link OutputStream} should not be written to before or after the hand-off. */ // TODO(user): Evaluate whether it makes sense to always piggyback the computation of a // HashCode on an existing OutputStream, compared to creating a separate OutputStream that could // be (optionally) be combined with another if needed (with something like // MultiplexingOutputStream).
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue Apr 20 18:43:59 UTC 2021 - 2.6K bytes - Viewed (0) -
tensorflow/compiler/jit/rearrange_function_argument_pass_test.cc
FunctionDef *xla_fdef = fdl.add_function(); TF_CHECK_OK(GraphToFunctionDef(*g, "f3", xla_fdef)); } FunctionLibraryDefinition fld(OpRegistry::Global(), fdl); // Build the XLA computation graph. // "arg0" (T=DT_RESOURCE), "arg1" (T=DT_INT32) // "arg0", "arg1" -> "if" (If) -> "ret0", "ret1" // "arg0", "arg1" -> "while" (While) -> "ret2", "ret3" tensorflow::Scope s = tensorflow::Scope::NewRootScope();
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri Feb 09 11:36:41 UTC 2024 - 10.5K bytes - Viewed (0)