Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 4 of 4 for PRECISION (0.06 sec)

  1. RELEASE.md

    *   TF Core:
    
        *   Certain float32 ops run in lower precision on Ampere based GPUs,
            including matmuls and convolutions, due to the use of
            [TensorFloat-32](https://blogs.nvidia.com/blog/2020/05/14/tensorfloat-32-precision-format/).
            Specifically, inputs to such ops are rounded from 23 bits of precision
            to 10 bits of precision. This is unlikely to cause issues in practice
    Registered: Tue Sep 09 12:39:10 UTC 2025
    - Last Modified: Mon Aug 18 20:54:38 UTC 2025
    - 740K bytes
    - Viewed (2)
  2. src/main/webapp/css/admin/bootstrap.min.css.map

    {\n      $remainder: $remainder - $divisor;\n      $quotient: $quotient + 1;\n    }\n    $result: $result * 10 + $quotient;\n    $factor: $factor * .1;\n    $remainder: $remainder * 10;\n    $precision: $precision - 1;\n    @if ($precision < 0 and $remainder >= $divisor * 5) {\n      $result: $result + 1;\n    }\n  }\n  $result: $result * $factor * $sign;\n  $dividend-unit: unit($dividend);\n  $divisor-unit: unit($divisor);\n  $unit-map: (\n    \"px\": 1px,\n    \"rem\": 1rem,\n    \"em\": 1em,\n...
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Sat Oct 26 01:49:09 UTC 2024
    - 639.3K bytes
    - Viewed (1)
  3. src/main/webapp/css/bootstrap.min.css.map

    {\n      $remainder: $remainder - $divisor;\n      $quotient: $quotient + 1;\n    }\n    $result: $result * 10 + $quotient;\n    $factor: $factor * .1;\n    $remainder: $remainder * 10;\n    $precision: $precision - 1;\n    @if ($precision < 0 and $remainder >= $divisor * 5) {\n      $result: $result + 1;\n    }\n  }\n  $result: $result * $factor * $sign;\n  $dividend-unit: unit($dividend);\n  $divisor-unit: unit($divisor);\n  $unit-map: (\n    \"px\": 1px,\n    \"rem\": 1rem,\n    \"em\": 1em,\n...
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Sun Jan 12 06:14:02 UTC 2025
    - 575.5K bytes
    - Viewed (0)
  4. lib/fips140/v1.0.0.zip

    az) } else { b = b.ShiftRightVarTime(bz) } gcd, err := bigmod.NewNat().GCDVarTime(a, b) if err != nil { return nil, err } if gcd.IsOdd() == 0 { return nil, errors.New("rsa: internal error: gcd(a, b) is even") } // To avoid implementing multiple-precision division, we just try again if // the divisor doesn't fit in a single word. This would have a chance of // 2⁻⁶⁴ on 64-bit platforms, and 2⁻³² on 32-bit platforms, but testing 2⁻⁶⁴ // edge cases is impractical, and we'd rather not behave differently...
    Registered: Tue Sep 09 11:13:09 UTC 2025
    - Last Modified: Wed Jan 29 15:10:35 UTC 2025
    - 635K bytes
    - Viewed (0)
Back to top