- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 58 for linear_1 (0.33 sec)
-
manifests/addons/dashboards/istio-extension-dashboard.json
"tooltip": false, "viz": false }, "insertNulls": false, "lineInterpolation": "linear", "lineWidth": 1, "pointSize": 5, "scaleDistribution": { "type": "linear" }, "showPoints": "never", "spanNulls": false, "stacking": { "group": "A",
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Wed Mar 27 03:47:04 UTC 2024 - 20K bytes - Viewed (0) -
src/cmd/link/internal/wasm/asm.go
ctxt.Out.WriteByte(0x00) // no max writeUleb128(ctxt.Out, numElements) // min writeSecSize(ctxt, sizeOffset) } // writeMemorySec writes the section that declares linear memories. Currently one linear memory is being used. // Linear memory always starts at address zero. More memory can be requested with the GrowMemory instruction. func writeMemorySec(ctxt *ld.Link, ldr *loader.Loader) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jan 22 16:17:48 UTC 2024 - 21.9K bytes - Viewed (0) -
manifests/addons/dashboards/istio-performance-dashboard.json
"tooltip": false, "viz": false }, "insertNulls": false, "lineInterpolation": "linear", "lineWidth": 1, "pointSize": 5, "scaleDistribution": { "type": "linear" }, "showPoints": "never", "spanNulls": false, "stacking": { "group": "A",
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Wed Mar 27 03:47:04 UTC 2024 - 39.6K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/decompose_resource_ops.td
// (multiply_linear_by_lr ? clamp(-l1 * lr, linear, l1 * lr) // clamp(-l1, linear, l1)) - linear (TF_SubOp:$linear_clipped_minus_linear (ConstAttrIfThenElse $multiply_linear_by_lr, (Clamp $src_op, (TF_NegOp (TF_MulOp $l1, $lr)), (CreateTFReadVariableOp $src_op, $l1, $linear), (TF_MulOp $l1, $lr) ), (Clamp $src_op,
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed May 22 19:47:48 UTC 2024 - 20.7K bytes - Viewed (0) -
tensorflow/cc/framework/scope.h
/// Scope linear = root.NewSubScope("linear"); /// // W will be named "linear/W" /// auto W = Variable(linear.WithOpName("W"), /// {2, 2}, DT_FLOAT); /// // b will be named "linear/b_3" /// int idx = 3; /// auto b = Variable(linear.WithOpName("b_", idx), /// {2}, DT_FLOAT); /// auto x = Const(linear, {...}); // name: "linear/Const"
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Sat Apr 13 09:08:33 UTC 2024 - 10.5K bytes - Viewed (0) -
docs/metrics/prometheus/grafana/node/minio-node.json
"tooltip": false, "viz": false }, "insertNulls": false, "lineInterpolation": "linear", "lineWidth": 1, "pointSize": 5, "scaleDistribution": { "type": "linear" }, "showPoints": "never", "spanNulls": false, "stacking": { "group": "A",
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Tue Jun 04 13:24:37 UTC 2024 - 22.4K bytes - Viewed (0) -
src/unicode/letter_test.go
var calibrate = flag.Bool("calibrate", false, "compute crossover for linear vs. binary search") func TestCalibrate(t *testing.T) { if !*calibrate { return } if runtime.GOARCH == "amd64" { fmt.Printf("warning: running calibration on %s\n", runtime.GOARCH) } // Find the point where binary search wins by more than 10%. // The 10% bias gives linear search an edge when they're close,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat Sep 09 01:46:03 UTC 2023 - 14.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TopKSelector.java
} return this; } /** * Adds each member of {@code elements} as a candidate for the top {@code k} elements. This * operation takes amortized linear time in the length of {@code elements}. * * <p>If all input data to this {@code TopKSelector} is in a single {@code Iterable}, prefer
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 11.2K bytes - Viewed (0) -
guava/src/com/google/common/collect/TopKSelector.java
} return this; } /** * Adds each member of {@code elements} as a candidate for the top {@code k} elements. This * operation takes amortized linear time in the length of {@code elements}. * * <p>If all input data to this {@code TopKSelector} is in a single {@code Iterable}, prefer
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 11.2K bytes - Viewed (0) -
src/index/suffixarray/sais.go
// is widened to a full integer array.) // The overall runtime of this code is linear in the input size: // it runs a sequence of linear passes to reduce the problem to // a subproblem at most half as big, invokes itself recursively, // and then runs a sequence of linear passes to turn the answer // for the subproblem into the answer for the original problem.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 18 23:57:18 UTC 2024 - 32.4K bytes - Viewed (0)