- Sort Score
- Result 10 results
- Languages All
Results 1 - 1 of 1 for shuffled (0.12 sec)
-
tensorflow/compiler/mlir/tf2xla/transforms/legalize_tf.cc
return no_op(); // For vectors, shuffle values by sorting instead of the obvious // Fisher-Yates algorithm. Fisher-Yates is simple to implement and correct, // but not easily parallelizable. For a sufficiently parallel architecture, // it is faster to sort many times, than Fisher-Yates shuffle once. if (input_rank == 1) { // Shuffle values by assigning each value a random key and sorting the
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Jun 11 20:00:43 UTC 2024 - 291.8K bytes - Viewed (0)