Search Options

Results per page
Sort
Preferred Languages
Advance

Results 251 - 255 of 255 for suggestor (0.08 sec)

  1. CHANGELOG/CHANGELOG-1.18.md

    ## Changelog since v1.18.0-beta.2
    
    ## Changes by Kind
    
    ### API Change
    
    - Removes ConfigMap as suggestion for IngressClass parameters ([#89093](https://github.com/kubernetes/kubernetes/pull/89093), [@robscott](https://github.com/robscott)) [SIG Network]
    
    ### Other (Bug, Cleanup or Flake)
    
    Registered: Fri Sep 05 09:05:11 UTC 2025
    - Last Modified: Wed Jun 16 17:18:28 UTC 2021
    - 373.2K bytes
    - Viewed (0)
  2. RELEASE.md

     *   Added `jit_compile` as a settable property to `tf.keras.Model`.
     *   Added `synchronized` optional parameter to `layers.BatchNormalization`.
     *   Added deprecation warning to `layers.experimental.SyncBatchNormalization` and suggested to use `layers.BatchNormalization` with `synchronized=True` instead.
     *   Updated `tf.keras.layers.BatchNormalization` to support masking of the inputs (`mask` argument) when computing the mean and variance.
    Registered: Tue Sep 09 12:39:10 UTC 2025
    - Last Modified: Mon Aug 18 20:54:38 UTC 2025
    - 740K bytes
    - Viewed (2)
  3. docs/en/docs/release-notes.md

    ### Refactors
    
    * 🔥 Remove unused NoneType. PR [#10774](https://github.com/tiangolo/fastapi/pull/10774) by [@tiangolo](https://github.com/tiangolo).
    
    ### Docs
    
    * 📝 Tweak default suggested configs for generating clients. PR [#10736](https://github.com/tiangolo/fastapi/pull/10736) by [@tiangolo](https://github.com/tiangolo).
    
    ### Internal
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Fri Sep 05 12:48:45 UTC 2025
    - 544.1K bytes
    - Viewed (0)
  4. CHANGELOG/CHANGELOG-1.19.md

    - Removes ConfigMap as suggestion for IngressClass parameters ([#89093](https://github.com/kubernetes/kubernetes/pull/89093), [@robscott](https://github.com/robscott)) [SIG Network]
    Registered: Fri Sep 05 09:05:11 UTC 2025
    - Last Modified: Wed Jan 05 05:42:32 UTC 2022
    - 489.7K bytes
    - Viewed (0)
  5. lib/fips140/v1.0.0.zip

    mLimbs, Y) T[n+i], c = bits.Add(c1, c2, c) } // Finally for Step 7 we copy the final T window into x, and subtract m // if necessary (which as explained in maybeSubtractModulus can be the // case both if x >= m, or if x overflowed). // // The paper suggests in Section 4 that we can do an "Almost Montgomery // Multiplication" by subtracting only in the overflow case, but the // cost is very similar since the constant time subtraction tells us if // x >= m as a side effect, and taking care of the broken...
    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