- Sort Score
- Result 10 results
- Languages All
Results 61 - 70 of 138 for linear_1 (0.28 sec)
-
tensorflow/compiler/mlir/tensorflow/transforms/decompose_reduce_dataset.cc
return WalkResult::advance(); OpBuilder builder(reduce_dataset); Location loc = reduce_dataset.getLoc(); // Get reduce function signature for dataset iteration types. // Note: lookupSymbol is a linear lookup which means the overall // complexity = # ReduceDataset ops x # of functions in module. func::FuncOp reduce_func = function->getParentOfType<ModuleOp>().lookupSymbol<FuncOp>(
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 14K bytes - Viewed (0) -
tensorflow/compiler/jit/xla_device.h
limitations under the License. ==============================================================================*/ // The XlaDevice executes a TensorFlow graph using the XLA linear algebra // runtime. // // Operators assigned to an XlaDevice are compiled into XLA computations. // Tensors on an XlaDevice are thin wrappers around XLA ScopedShapedBuffers. //
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Feb 21 09:53:30 UTC 2024 - 13.4K bytes - Viewed (0) -
src/runtime/runtime.go
unlock(&ticks.lock) } // minTimeForTicksPerSecond is the minimum elapsed time we require to consider our ticksPerSecond // measurement to be of decent enough quality for profiling. // // There's a linear relationship here between minimum time and error from the true value. // The error from the true ticks-per-second in a linux/amd64 VM seems to be: // - 1 ms -> ~0.02% error // - 5 ms -> ~0.004% error
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:16:47 UTC 2024 - 9.9K bytes - Viewed (0) -
src/unicode/letter.go
// this CaseRange represents a sequence of the form (say) // [Upper] [Lower] [Upper] [Lower]. const ( UpperLower = MaxRune + 1 // (Cannot be a valid delta.) ) // linearMax is the maximum size table for linear search for non-Latin1 rune. // Derived by running 'go test -calibrate'. const linearMax = 18 // is16 reports whether r is in the sorted slice of 16-bit ranges. func is16(ranges []Range16, r uint16) bool {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Nov 06 20:02:46 UTC 2023 - 10K bytes - Viewed (0) -
src/runtime/asm_wasm.s
TEXT wasm_pc_f_loop(SB),NOSPLIT,$0 // Call the function for the current PC_F. Repeat until PAUSE != 0 indicates pause or exit. // The WebAssembly stack may unwind, e.g. when switching goroutines. // The Go stack on the linear memory is then used to jump to the correct functions // with this loop, without having to restore the full WebAssembly stack. // It is expected to have a pending call before entering the loop, so check PAUSE first. Get PAUSE
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Nov 20 21:26:51 UTC 2023 - 11.8K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/nilcheck_test.go
func BenchmarkNilCheckDeep10000(b *testing.B) { benchmarkNilCheckDeep(b, 10000) } // benchmarkNilCheckDeep is a stress test of nilcheckelim. // It uses the worst possible input: A linear string of // nil checks, none of which can be eliminated. // Run with multiple depths to observe big-O behavior. func benchmarkNilCheckDeep(b *testing.B, depth int) { c := testConfig(b) ptrType := c.config.Types.BytePtr
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Nov 17 23:34:11 UTC 2023 - 12.3K bytes - Viewed (0) -
android/guava/src/com/google/common/math/BigIntegerMath.java
} } /* * The maximum number of bits in a square root for which we'll precompute an explicit half power * of two. This can be any value, but higher values incur more class load time and linearly * increasing memory consumption. */ @VisibleForTesting static final int SQRT2_PRECOMPUTE_THRESHOLD = 256; @VisibleForTesting static final BigInteger SQRT2_PRECOMPUTED_BITS =
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 18.9K bytes - Viewed (0) -
guava/src/com/google/common/math/BigIntegerMath.java
} } /* * The maximum number of bits in a square root for which we'll precompute an explicit half power * of two. This can be any value, but higher values incur more class load time and linearly * increasing memory consumption. */ @VisibleForTesting static final int SQRT2_PRECOMPUTE_THRESHOLD = 256; @VisibleForTesting static final BigInteger SQRT2_PRECOMPUTED_BITS =
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 18.9K bytes - Viewed (0) -
src/internal/trace/gc.go
// We think of the mutator utilization over time as the // box-filtered utilization function, which we call the // "windowed mutator utilization function". The resulting // function is continuous and piecewise linear (unless // window==0, which we handle elsewhere), where the boundaries // between segments occur when either edge of the window // encounters a change in the instantaneous mutator
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 26K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/ir/tf_generated_ops.td
}]; let description = [{ That is for rows we have grad for, we update var, accum and linear as follows: accum_new = accum + grad * grad linear += grad - (accum_new^(-lr_power) - accum^(-lr_power)) / lr * var quadratic = 1.0 / (accum_new^(lr_power) * lr) + 2 * l2 var = (sign(linear) * l1 - linear) / quadratic if |linear| > l1 else 0.0 accum = accum_new }]; let arguments = (ins
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Jun 11 23:24:08 UTC 2024 - 793K bytes - Viewed (0)