- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 48 for linear_1 (0.12 sec)
-
docs/metrics/prometheus/grafana/bucket/minio-bucket.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: Fri May 24 11:11:51 UTC 2024 - 101.8K bytes - Viewed (0) -
docs/metrics/prometheus/grafana/replication/minio-replication-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: Thu Jun 13 22:26:54 UTC 2024 - 57.4K 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/minio-dashboard.json
"tooltip": false, "viz": false }, "insertNulls": false, "lineInterpolation": "linear", "lineWidth": 1, "pointSize": 5, "scaleDistribution": { "type": "linear" }, "showPoints": "never", "spanNulls": true, "stacking": { "group": "A",
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Mon Apr 15 10:03:01 UTC 2024 - 93K 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) -
samples/addons/grafana.yaml
xt","axisLabel":"","axisPlacement":"auto","barAlignment":0,"drawStyle":"line","fillOpacity":10,"gradientMode":"none","hideFrom":{"legend":false,"tooltip":false,"viz":false},"insertNulls":false,"lineInterpolation":"linear","lineWidth":1,"pointSize":5,"scaleDistribution":{"type":"linear"},"showPoints":"never","spanNulls":false,"stacking":{"group":"A","mode":"none"},"thresholdsStyle":{"mode":"off"}},"mappings":[],"thresholds":{"mode":"absolute","steps":[{"color":"green","value":null},{"color":"red"...
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Wed Jun 12 20:46:28 UTC 2024 - 242.3K bytes - Viewed (0) -
src/cmd/trace/pprof.go
// Insert regardless of whether we have a match in m.pcs. // Even if we have a match, we want to keep the newest version // of that stack, since we're much more likely tos see it again // as we iterate through the trace linearly. Simultaneously, we // are likely to never see the old stack again. m.pcs[pcs] = stack m.stacks[stack] = rec return rec } func (m *stackMap) profile() []traceviewer.ProfileRecord {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 10.1K bytes - Viewed (0) -
src/internal/reflectlite/type.go
// In both cases the algorithm is a linear scan over the two // lists - T's methods and V's methods - simultaneously. // Since method tables are stored in a unique sorted order // (alphabetical, with no duplicate method names), the scan // through V's methods must hit a match for each of T's // methods along the way, or else V does not implement T. // This lets us run the scan in overall linear time instead of
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 07 17:01:54 UTC 2024 - 16.2K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/tests/decompose_resource_ops.mlir
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed May 22 19:47:48 UTC 2024 - 51.3K bytes - Viewed (0)