Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 18 for releases (0.2 sec)

  1. LICENSE

       SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
    
    CONTRIBUTION AGREEMENT
    
    By contributing to the BVLC/caffe repository through pull-request, comment,
    or otherwise, the contributor releases their content to the
    Plain Text
    - Registered: Tue May 07 12:40:20 GMT 2024
    - Last Modified: Mon Nov 29 17:31:56 GMT 2021
    - 13.3K bytes
    - Viewed (0)
  2. tensorflow/c/eager/c_api_experimental_test.cc

                                     status);
      EXPECT_EQ(TF_GetCode(status), TF_OK) << TF_Message(status);
    
      TFE_DeleteContextOptions(opts);
      TFE_DeleteContext(ctx);
      TF_DeleteStatus(status);
    
      w0.release();
      w1.release();
    }
    
    TEST(CAPI, ShareVariableAcrossContextsAfterUpdateContextWorksWithTimeout) {
      tensorflow::ServerDef server_def_0 = GetServerDef(3);
    C++
    - Registered: Tue Apr 30 12:39:09 GMT 2024
    - Last Modified: Thu Aug 03 03:14:26 GMT 2023
    - 31.5K bytes
    - Viewed (1)
  3. tensorflow/c/experimental/filesystem/plugins/gcs/ram_file_block_cache.cc

        switch (block->state) {
          case FetchState::ERROR:
            // TF_FALLTHROUGH_INTENDED
          case FetchState::CREATED:
            block->state = FetchState::FETCHING;
            block->mu.Unlock();  // Release the lock while making the API call.
            block->data.clear();
            block->data.resize(block_size_, 0);
            int64_t bytes_transferred;
            bytes_transferred = block_fetcher_(key.first, key.second, block_size_,
    C++
    - Registered: Tue Apr 23 12:39:09 GMT 2024
    - Last Modified: Thu Jul 16 01:39:09 GMT 2020
    - 11.1K bytes
    - Viewed (0)
  4. tensorflow/c/eager/tape.h

    // Accumulate runs the gradient computation immediately.
    //
    // Keeps references to Tensors watched via Watch and computed in Accumulate
    // corresponding to output_tensors, and releases these references in its
    // destructor. However, waiting until the destructor runs loses the memory
    // efficiency of forward-mode autodiff. Instead, language bindings should call
    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)
  5. tensorflow/c/eager/c_api_experimental.h

                                                                  TF_Status*);
    
    // Creates a new TensorHandle from memory residing in the physical device
    // device_name. Takes ownership of the memory, and will call deleter to release
    // it after TF no longer needs it or in case of error.
    //
    // Custom devices must use TFE_NewCustomDeviceTensorHandle instead.
    TF_CAPI_EXPORT extern TFE_TensorHandle* TFE_NewTensorHandleFromDeviceMemory(
    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)
  6. CONTRIBUTING.md

        and
        [tensorflow/python](https://github.com/tensorflow/tensorflow/tree/master/tensorflow/python).
        TensorFlow has passed version 1.0 and hence cannot make
        non-backward-compatible API changes without a major release. Reviewers of
        your pull request will comment on any API compatibility issues
        [following API review practices](https://github.com/tensorflow/community/blob/master/governance/api-reviews.md).
    Plain Text
    - Registered: Tue May 07 12:40:20 GMT 2024
    - Last Modified: Thu Mar 21 11:45:51 GMT 2024
    - 15.6K bytes
    - Viewed (0)
  7. tensorflow/c/eager/gradients.cc

      forward_op_->attrs.BuildNodeDef();
      std::unique_ptr<GradientFunction> gradient_fn;
      TF_RETURN_IF_ERROR(registry.Lookup(*forward_op_, &gradient_fn));
      tape->RecordOperation(forward_op_->inputs, retvals, gradient_fn.release(),
                            op_->Name());
      return absl::OkStatus();
    }
    }  // namespace internal
    
    }  // namespace gradients
    C++
    - Registered: Tue Apr 30 12:39:09 GMT 2024
    - Last Modified: Thu Feb 15 09:49:45 GMT 2024
    - 19.3K bytes
    - Viewed (0)
  8. tensorflow/c/eager/immediate_execution_context.h

      // Create a tensor instance from the given data buffer and description.
      // `memory_releaser` will be called on destruction, and it's responsible for
      // cleaning up the underlying buffer.
      virtual AbstractTensorInterface* CreateTensor(
          DataType dtype, const int64_t* dims, int num_dims, void* data, size_t len,
          MemoryReleaser memory_releaser, void* memory_releaser_arg) = 0;
    
      // Create a handle to wrap and manage a Tensor
    C
    - Registered: Tue Apr 30 12:39:09 GMT 2024
    - Last Modified: Thu Jul 06 08:34:00 GMT 2023
    - 12.3K bytes
    - Viewed (0)
  9. tensorflow/c/eager/c_api_unified_experimental_graph.cc

    };
    
    // GraphOperation wraps and populates a TF_OperationDescription.
    class GraphOperation : public TracingOperation {
     public:
      explicit GraphOperation(TF_Graph* g) : TracingOperation(kGraph), g_(g) {}
      void Release() override { delete this; }
      Status Reset(const char* op, const char* raw_device_name) override {
        if (op_) {
          return errors::FailedPrecondition("Reset called on already built op.");
        }
    C++
    - Registered: Tue Apr 30 12:39:09 GMT 2024
    - Last Modified: Tue Mar 12 20:00:09 GMT 2024
    - 15.4K bytes
    - Viewed (1)
  10. tensorflow/c/eager/c_api.cc

      status->status = new_op->Reset(op_or_function_name, nullptr);
      if (!status->status.ok()) {
        new_op->Release();
        new_op = nullptr;
      }
      return tensorflow::wrap(new_op);
    }
    
    void TFE_DeleteOp(TFE_Op* op) {
      if (op == nullptr) {
        return;
      }
    
      tensorflow::unwrap(op)->Release();
    }
    
    const char* TFE_OpGetName(const TFE_Op* op, TF_Status* status) {
    C++
    - Registered: Tue Apr 30 12:39:09 GMT 2024
    - Last Modified: Tue Mar 12 20:00:09 GMT 2024
    - 43.9K bytes
    - Viewed (2)
Back to top