Εμφανίζονται 1 - 8 Αποτελέσματα από 8 για την αναζήτηση '"Time complexity."', χρόνος αναζήτησης: 0,02δλ Περιορισμός αποτελεσμάτων
  1. 1

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

    Τόπος έκδοσης Parallel algorithms and applications.
    Άρθρο

    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. ανά Tsirigos, A.

    Τόπος έκδοσης IEEE Communications magazine
    Άρθρο

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

    On the message and time complexity of protocols for reliable broadcasts ανά Hong-Yi Tzeng

    Άρθρο

    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. ανά Yeung, K.L

    Τόπος έκδοσης IEEE Transactions on communications
    Άρθρο

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

    Computing with words via Turing machines a formal approach. ανά Huaiqing Wang

    Τόπος έκδοσης IEEE Transactions on fuzzy systems
    Άρθρο

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

    Optimal parallel selection in sorted matrices. ανά Shen, Hong

    Τόπος έκδοσης Information processing letters.
    Άρθρο

    Optimal parallel selection in sorted matrices.
  7. 7

    Leader election in complete networks. ανά Singh, Gurdip

    Τόπος έκδοσης SIAM journal on computing.
    Άρθρο

    Leader election in complete networks.
  8. 8

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

    Τόπος έκδοσης IEEE Transactions on software engineering
    Άρθρο

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

Εργαλεία αναζήτησης: