- Sort Score
- Num 10 results
- Language All
Results 1 - 5 of 5 for Runs (0.05 seconds)
-
RELEASE.md
This runs the MLIR bridge only when an analysis of the graph only when an analysis of the graph determines that it is safe to run. * Add new enum value `MLIR_BRIDGE_ROLLOUT_SAFE_MODE_FALLBACK_ENABLED' to`tf.config.experimental.mlir_bridge_rollout` to enable a fallback for the MLIR bridge in a \"safe\" mode. This runs the MLIR bridge in aCreated: Tue Apr 07 12:39:13 GMT 2026 - Last Modified: Mon Mar 30 18:31:38 GMT 2026 - 746.5K bytes - Click Count (3) -
CHANGELOG/CHANGELOG-1.19.md
- A new extension point `PostFilter` is introduced to scheduler framework which runs after Filter phase to resolve scheduling filter failures. A typical implementation is running preemption logic. ([#91314](https://github.com/kubernetes/kubernetes/pull/91314), [@Huang-Wei](https://github.com/Huang-Wei)) [SIG Scheduling and Testing]...
Created: Fri Apr 03 09:05:14 GMT 2026 - Last Modified: Wed Jan 05 05:42:32 GMT 2022 - 489.7K bytes - Click Count (0) -
lib/fips140/v1.26.0.zip
https://github.com/mit-plv/fiat-crypto/pull/333/files. // // Following the proof linked in the PR above, the changes are: // // 1. Negate [B] and [C] so they are positive. The invariant now involves a // subtraction. // 2. If step 2 (both [x] and [y] are even) runs, abort immediately. This // case needs to be handled by the caller. // 3. Subtract copies of [x] and [y] as needed in step 6 (both [u] and [v] // are odd) so coefficients stay in bounds. // 4. Replace the [u >= v] check with [u > v]. This changes the...
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Jan 08 17:58:32 GMT 2026 - 660.3K bytes - Click Count (0) -
lib/fips140/v1.0.0-c2097c7c.zip
https://github.com/mit-plv/fiat-crypto/pull/333/files. // // Following the proof linked in the PR above, the changes are: // // 1. Negate [B] and [C] so they are positive. The invariant now involves a // subtraction. // 2. If step 2 (both [x] and [y] are even) runs, abort immediately. This // case needs to be handled by the caller. // 3. Subtract copies of [x] and [y] as needed in step 6 (both [u] and [v] // are odd) so coefficients stay in bounds. // 4. Replace the [u >= v] check with [u > v]. This changes the...
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Sep 25 19:53:19 GMT 2025 - 642.7K bytes - Click Count (0) -
docs/en/docs/release-notes.md
### Internal * 🔧 Add Striveworks sponsor. PR [#4596](https://github.com/tiangolo/fastapi/pull/4596) by [@tiangolo](https://github.com/tiangolo). * 💚 Only build docs on push when on master to avoid duplicate runs from PRs. PR [#4564](https://github.com/tiangolo/fastapi/pull/4564) by [@tiangolo](https://github.com/tiangolo).
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Fri Apr 03 12:07:04 GMT 2026 - 631K bytes - Click Count (0)