Đang hiển thị 1 - 8 kết quả của 8 cho tìm kiếm '"Time complexity."', thời gian truy vấn: 0.02s Tinh chỉnh kết quả
  1. 1

    Fast nearest neighbor algorithms on a linear array with a reconfigurable pipelined bus system. Bằng Pan, Yi

    Bài viết

    Fast nearest neighbor algorithms on a linear array with a reconfigurable pipelined bus system.
  2. 2

    Multipath routing in the presence of frequent topological changes. Bằng Tsirigos, A.

    Xuất bản năm IEEE Communications magazine
    Bài viết

    Multipath routing in the presence of frequent topological changes.
  3. 3

    On the message and time complexity of protocols for reliable broadcasts Bằng Hong-Yi Tzeng

    Bài viết

    On the message and time complexity of protocols for reliable broadcasts
  4. 4

    Efficient time slot assignment algorithms for TDM hierarchical and nonhierarchical switching systems. Bằng Yeung, K.L

    Bài viết

    Efficient time slot assignment algorithms for TDM hierarchical and nonhierarchical switching systems.
  5. 5

    Computing with words via Turing machines a formal approach. Bằng Huaiqing Wang

    Bài viết

    Computing with words via Turing machines a formal approach.
  6. 6

    Optimal parallel selection in sorted matrices. Bằng Shen, Hong

    Bài viết

    Optimal parallel selection in sorted matrices.
  7. 7

    Leader election in complete networks. Bằng Singh, Gurdip

    Xuất bản năm SIAM journal on computing.
    Bài viết

    Leader election in complete networks.
  8. 8

    Testing homogeneous spreadsheet grids with the "what you see is what you test" methodology. Bằng Burnett, M.

    Bài viết

    Testing homogeneous spreadsheet grids with the "what you see is what you test" methodology.

Công cụ tìm kiếm: