Εμφανίζονται 241 - 250 Αποτελέσματα από 389 για την αναζήτηση 'Journal of algorithms.', χρόνος αναζήτησης: 0,02δλ Περιορισμός αποτελεσμάτων
  1. 241

    The Application of distributed discrete event stimulation algorithms to concatenated local-area and wide-area network (CLOWN) simulation. [article]. ανά Carreon, Mario

    Analytics

    The Application of distributed discrete event stimulation algorithms to concatenated local-area and wide-area network (CLOWN) simulation. [article].
  2. 242

    Multiobjective optimization and evolutionary algorithms. ανά Pangilinan, Jose Maria A. ; Janssens, Gerrit K.

    Τόπος έκδοσης Saint Louis University research journal
    Άρθρο

    Multiobjective optimization and evolutionary algorithms.
  3. 243

    A search algorithm for rescheduling a grid service matrix. ανά Getao, Katherine W. ; Opiyo, Elisha T.O

    Τόπος έκδοσης Saint Louis University research journal
    Άρθρο

    A search algorithm for rescheduling a grid service matrix.
  4. 244

    Indexing compressed text. ανά Ferragina, Paolo

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

    Indexing compressed text.
  5. 245

    Source routing and scheduling in packet networks. ανά Andrews, Matthew

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

    Source routing and scheduling in packet networks.
  6. 246

    Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. ανά Kaplan, Haim

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

    Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs.
  7. 247

    Concurrent zero-knowledge. ανά Dwork, Cynthia

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

    Concurrent zero-knowledge.
  8. 248

    New lattice-based cryptographic constructions. ανά Regev, Oded

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

    New lattice-based cryptographic constructions.
  9. 249

    Fast monte-carlo algorithms for finding low-rank approximations. ανά Frieze, Alan

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

    Fast monte-carlo algorithms for finding low-rank approximations.
  10. 250

    Almost tight upper bounds for vertical decompositions in four dimensions. ανά Koltun, Vladlen

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

    Almost tight upper bounds for vertical decompositions in four dimensions.

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