Erakusten 1 - 8 emaitzak -- 8 bilaketa honetara '"Time complexity."', Bilaketaren denbora: 0,02s Findu emaitzak
  1. 1

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

    Artikulua

    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. nork Tsirigos, A.

    Argitaratua izan da IEEE Communications magazine
    Artikulua

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

    On the message and time complexity of protocols for reliable broadcasts nork Hong-Yi Tzeng

    Artikulua

    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. nork Yeung, K.L

    Artikulua

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

    Computing with words via Turing machines a formal approach. nork Huaiqing Wang

    Artikulua

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

    Optimal parallel selection in sorted matrices. nork Shen, Hong

    Argitaratua izan da Information processing letters.
    Artikulua

    Optimal parallel selection in sorted matrices.
  7. 7

    Leader election in complete networks. nork Singh, Gurdip

    Argitaratua izan da SIAM journal on computing.
    Artikulua

    Leader election in complete networks.
  8. 8

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

    Artikulua

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

Bilaketa egiteko lanabesak: