Search Options

Results per page
Sort
Preferred Languages
Advance

Results 31 - 36 of 36 for narrower (0.12 sec)

  1. tensorflow/compiler/mlir/quantization/common/quantization_lib/quantization_driver.cc

        // parameters are created from the weights when the ops support per-channel
        // quantization. Otherwise, uses per-tensor asymmetric quantization with
        // narrow range.
    
        // per-axis quantization weight, with symmetric min/max enforced.
        final_type = GetUniformQuantizedPerAxisTypeForWeight(
            attr, it->second, /*symmetric=*/true, /*num_bits=*/8, is_signed_,
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Thu Apr 25 16:01:03 UTC 2024
    - 38.1K bytes
    - Viewed (0)
  2. platforms/documentation/docs/src/docs/userguide/dep-man/04-modeling-features/variant_model.adoc

    The consumer can define any number of attributes.
    Each attribute helps narrow the possible variants that can be selected.
    Attribute values do not need to be exact matches.
    
    The variant can also define any number of attributes.
    The attributes should describe how the variant is intended to be used.
    Registered: Wed Jun 12 18:38:38 UTC 2024
    - Last Modified: Tue Apr 02 20:50:18 UTC 2024
    - 34.2K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/math/LongMath.java

        /*
         * Based on Hacker's Delight Fig. 11-5, the two-table-lookup, branch-free implementation.
         *
         * The key idea is that based on the number of leading zeros (equivalently, floor(log2(x))), we
         * can narrow the possible floor(log10(x)) values to two. For example, if floor(log2(x)) is 6,
         * then 64 <= x < 128, so floor(log10(x)) is either 1 or 2.
         */
        int y = maxLog10ForLeadingZeros[Long.numberOfLeadingZeros(x)];
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Wed Feb 07 17:50:39 UTC 2024
    - 44.6K bytes
    - Viewed (0)
  4. guava/src/com/google/common/math/LongMath.java

        /*
         * Based on Hacker's Delight Fig. 11-5, the two-table-lookup, branch-free implementation.
         *
         * The key idea is that based on the number of leading zeros (equivalently, floor(log2(x))), we
         * can narrow the possible floor(log10(x)) values to two. For example, if floor(log2(x)) is 6,
         * then 64 <= x < 128, so floor(log10(x)) is either 1 or 2.
         */
        int y = maxLog10ForLeadingZeros[Long.numberOfLeadingZeros(x)];
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Wed Feb 07 17:50:39 UTC 2024
    - 44.6K bytes
    - Viewed (0)
  5. src/cmd/cgo/internal/testshared/shared_test.go

    	// exe will abort with a complaint on startup.
    	// This assumes adding an exported function breaks ABI, which is not true in
    	// some senses but suffices for the narrow definition of ABI compatibility the
    	// toolchain uses today.
    	resetFileStamps()
    
    	createFile(t, "./depBase/break.go", "package depBase\nfunc ABIBreak() {}\n")
    	defer os.Remove("./depBase/break.go")
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Sat Aug 26 01:54:41 UTC 2023
    - 36.3K bytes
    - Viewed (0)
  6. src/cmd/link/link_test.go

    length before the Court, perennially hopeless."`
    
    	principle int `text:"The one great principle of the English law is, to make business for itself. There is no other principle distinctly, certainly, and consistently maintained through all its narrow turnings. Viewed by this light it becomes a coherent scheme, and not the monstrous maze the laity are apt to think it. Let them but once clearly perceive that its grand principle is to make business for itself at their expense, and surely they will...
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri May 24 20:26:02 UTC 2024
    - 43.5K bytes
    - Viewed (0)
Back to top