- Sort Score
- Result 10 results
- Languages All
Results 1 - 5 of 5 for eier (0.04 sec)
-
fess-crawler/src/test/resources/extractor/eml/sample4.eml
traditionellen Bogenschießens und Technik sowie sicherheitsrelevante Themen. Das Bogenschießen wird in Kleingruppen durchgeführt. Workshop Nr. 3: Neben einer kleinen Einführung in die Geschichte und Chemie der Naturkosmetik steht Selbermachen auf dem Programm. Im Grundkurs erlernen Sie die Herstellung von einfachen Hautcremes. In Kleingruppen erarbeiten Sie selbständig ein
Registered: Sun Sep 21 03:50:09 UTC 2025 - Last Modified: Sun Jan 07 09:15:11 UTC 2018 - 681K bytes - Viewed (0) -
CHANGELOG/CHANGELOG-1.19.md
- It is now possible to use the service annotation `cloud.google.com/network-tier: Standard` to configure the Network Tier of the GCE Loadbalancer ([#88532](https://github.com/kubernetes/kubernetes/pull/88532), [@zioproto](https://github.com/zioproto)) [SIG Cloud Provider, Network and Testing]
Registered: Fri Sep 05 09:05:11 UTC 2025 - Last Modified: Wed Jan 05 05:42:32 UTC 2022 - 489.7K bytes - Viewed (0) -
RELEASE.md
layers in order to work, where the Keras symbolic shape inference proves insufficient. * Code that tries manually walking a `tf.keras.Model` layer by layer and assumes layers only ever have one positional argument. This assumption doesn't hold true before TF 2.4 either, but is more likely to cause issues now. * Code that manually enters `keras.backend.get_graph()` before building a
Registered: Tue Sep 09 12:39:10 UTC 2025 - Last Modified: Mon Aug 18 20:54:38 UTC 2025 - 740K bytes - Viewed (2) -
docs/en/docs/release-notes.md
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Fri Sep 05 12:48:45 UTC 2025 - 544.1K bytes - Viewed (0) -
lib/fips140/v1.0.0.zip
bits; excess != 0 { b[0] >>= excess } // Don't let the value be too small: set the most significant two bits. // Setting the top two bits, rather than just the top bit, means that // when two of these values are multiplied together, the result isn't // ever one bit short. if excess := len(b)*8 - bits; excess < 7 { b[0] |= 0b1100_0000 >> excess } else { b[0] |= 0b0000_0001 b[1] |= 0b1000_0000 } // Make the value odd since an even number certainly isn't prime. b[len(b)-1] |= 1 // We don't need to check...
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Wed Jan 29 15:10:35 UTC 2025 - 635K bytes - Viewed (0)