Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 4 of 4 for mask (0.13 sec)

  1. tensorflow/c/eager/c_api_experimental.h

    // custom devices will fail.
    //
    // `device_name` must not name an existing physical or custom device. It must
    // follow the format:
    //
    //    /job:<name>/replica:<replica>/task:<task>/device:<type>:<device_num>
    //
    // If the device is successfully registered, `status` is set to TF_OK. Otherwise
    // the device is not usable. In case of a bad status, `device.delete_device` is
    C
    - Registered: Tue Apr 30 12:39:09 GMT 2024
    - Last Modified: Wed Feb 21 22:37:46 GMT 2024
    - 39.5K bytes
    - Viewed (0)
  2. tensorflow/c/eager/parallel_device/parallel_device_lib.h

          TF_Status* status) const;
    
      void AsyncWait(TFE_Context* context, TF_Status* status) const;
    
      // Device strings for component devices that only include a
      // worker/task/replica if any of those differ across components. Useful for
      // printing debug messages.
      std::vector<std::string> SummarizeDeviceNames() const;
    
     private:
    C
    - Registered: Tue Apr 30 12:39:09 GMT 2024
    - Last Modified: Tue Apr 25 15:21:13 GMT 2023
    - 12.9K bytes
    - Viewed (0)
  3. tensorflow/c/c_api_experimental.h

    // multi worker collective ops to detect failures in the cluster.  If a peer is
    // down, collective ops may hang.
    TF_CAPI_EXPORT extern void TFE_CollectiveOpsCheckPeerHealth(
        TFE_Context* ctx, const char* task, int64_t timeout_in_ms,
        TF_Status* status);
    
    // Information about the shape of a Tensor and its type.
    struct TF_ShapeAndType {
      // Number of dimensions. -1 indicates unknown rank.
      int num_dims;
    C
    - Registered: Tue Apr 30 12:39:09 GMT 2024
    - Last Modified: Thu Apr 27 21:07:00 GMT 2023
    - 15.1K bytes
    - Viewed (0)
  4. tensorflow/c/eager/tape.h

    // gradients available initially).
    //
    // Then we repeatedly pop an entry from the stack, run its backprop, and update
    // the gradients of its inputs. Once we have computed all gradients for a single
    // input we can mark this input as done, and this can trigger adding an entry to
    // the stack if all outputs of that entry are now done.
    //
    // When the stack is empty we have gradients for all tensors we're interested
    // in.
    
    namespace {
    C
    - Registered: Tue Apr 30 12:39:09 GMT 2024
    - Last Modified: Tue Apr 02 12:40:29 GMT 2024
    - 47.2K bytes
    - Viewed (1)
Back to top