- Sort Score
- Num 10 results
- Language All
Results 1 - 4 of 4 for robust (0.07 seconds)
-
RELEASE.md
# Release 2.0.0 ## Major Features and Improvements TensorFlow 2.0 focuses on **simplicity** and **ease of use**, featuring updates like: * Easy model building with Keras and eager execution. * Robust model deployment in production on any platform. * Powerful experimentation for research. * API simplification by reducing duplication and removing deprecated endpoints.Created: Tue Apr 07 12:39:13 GMT 2026 - Last Modified: Mon Mar 30 18:31:38 GMT 2026 - 746.5K bytes - Click Count (3) -
src/main/java/org/codelibs/fess/mylasta/direction/FessConfig.java
* Get the value for the key 'crawler.ignore.robots.txt'. <br> * The value is, e.g. false <br> * comment: Whether to ignore robots.txt during crawling. * @return The value of found property. (NotNull: if not found, exception but basically no way) */ String getCrawlerIgnoreRobotsTxt(); /** * Is the property for the key 'crawler.ignore.robots.txt' true? <br> * The value is, e.g. false <br>
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sat Mar 28 06:59:19 GMT 2026 - 576.9K bytes - Click Count (2) -
docs/en/docs/release-notes.md
## 0.130.0 (2026-02-22) ### Features * ✨ Serialize JSON response with Pydantic (in Rust), when there's a Pydantic return type or response model. PR [#14962](https://github.com/fastapi/fastapi/pull/14962) by [@tiangolo](https://github.com/tiangolo). * This results in 2x (or more) performance increase for JSON responses.
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Fri Apr 03 12:07:04 GMT 2026 - 631K bytes - Click Count (0) -
lib/fips140/v1.26.0.zip
use the exponentiation by (p + 1) / 4 like // for the other primes. Instead, implement a variation of Tonelli–Shanks. // The constant-time implementation is adapted from Thomas Pornin's ecGFp5. // // https://github.com/pornin/ecgfp5/blob/82325b965/rust/src/field.rs#L337-L385 // p = q*2^n + 1 with q odd -> q = 2^128 - 1 and n = 96 // g^(2^n) = 1 -> g = 11 ^ q (where 11 is the smallest non-square) // GG[j] = g^(2^j) for j = 0 to n-1 p224GGOnce.Do(func() { p224GG = new([96]fiat.P224Element) for i :=...
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)