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

    A cooperative uplink power control scheme for elastic data services in wireless CDMA systems. ανά Alyfantis, George

    Τόπος έκδοσης Computer communication review.
    Άρθρο

    A cooperative uplink power control scheme for elastic data services in wireless CDMA systems.
  2. 902

    Hyperspherical neighbourhoods and pattern recognition using neural networks. ανά Athitan, G.

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

    Hyperspherical neighbourhoods and pattern recognition using neural networks.
  3. 903

    10 Networking Papers readings for protocol design. ανά Wetherall, David

    Τόπος έκδοσης Computer communication review.
    Άρθρο

    10 Networking Papers readings for protocol design.
  4. 904

    Flow labelled IP over ATM design and rationale. ανά Minshall, Greg

    Τόπος έκδοσης Computer communication review.
    Άρθρο

    Flow labelled IP over ATM design and rationale.
  5. 905

    On-line longest fragment first parsing algorithm. ανά Nagumo, Hideo

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

    On-line longest fragment first parsing algorithm.
  6. 906

    A linear time algorithm for finding all hinge vertices of a permutation graph. ανά Ho, Ting-Yem

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

    A linear time algorithm for finding all hinge vertices of a permutation graph.
  7. 907

    Finding pattern matchings for permutations. ανά Ibarra, Louis

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

    Finding pattern matchings for permutations.
  8. 908

    An in-place sorting with O(nlog n) comparisons and O(n) moves. ανά Franceschini, Gianni

    Τόπος έκδοσης Journal of the ACM
    Άρθρο

    An in-place sorting with O(nlog n) comparisons and O(n) moves.
  9. 909

    Asymmetric k-center is log* n-hard to approximate. ανά Chuzhoy, Julia

    Τόπος έκδοσης Journal of the ACM
    Άρθρο

    Asymmetric k-center is log* n-hard to approximate.
  10. 910

    Boosting textual compression in optimal linear time. ανά Ferragina, Paolo

    Τόπος έκδοσης Journal of the ACM
    Άρθρο

    Boosting textual compression in optimal linear time.

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