Erakusten 1.621 - 1.630 emaitzak -- 1.827 bilaketa honetara '"Algorithm."', Bilaketaren denbora: 0,02s Findu emaitzak
  1. 1621

    Making gnutella-like P2P systems scalable. nork Chawathe, Yatin

    Argitaratua izan da Computer communication review.
    Artikulua

    Making gnutella-like P2P systems scalable.
  2. 1622

    Fast partitioning l-apex graphs with applications to approximating maximum induced-subgraph problems. nork Thilikos, Dimitrios M.

    Argitaratua izan da Information processing letters.
    Artikulua

    Fast partitioning l-apex graphs with applications to approximating maximum induced-subgraph problems.
  3. 1623

    Distributed enumeration. nork Mazurkiewicz, Antoni

    Argitaratua izan da Information processing letters.
    Artikulua

    Distributed enumeration.
  4. 1624

    Efficient and decentralized computation of approximate global state. nork Keshav, S.

    Argitaratua izan da Computer communication review.
    Artikulua

    Efficient and decentralized computation of approximate global state.
  5. 1625

    Parallel maximum independent set in convex bipartite graphs. nork Czumaj, Artur

    Argitaratua izan da Information processing letters.
    Artikulua

    Parallel maximum independent set in convex bipartite graphs.
  6. 1626

    The Convex-hull and k-line travelling salesman problem. nork Deineko, Vladimir G.

    Argitaratua izan da Information processing letters.
    Artikulua

    The Convex-hull and k-line travelling salesman problem.
  7. 1627

    A note on the expected path length of trees with known fringe. nork De Prisco, Roberto

    Argitaratua izan da Information processing letters.
    Artikulua

    A note on the expected path length of trees with known fringe.
  8. 1628

    A framework to animate string algorithms. nork Baeza-Yates, Ricardo A.

    Argitaratua izan da Information processing letters.
    Artikulua

    A framework to animate string algorithms.
  9. 1629

    Scheduling chains to minimize mean flow time. nork Dror, Moshe

    Argitaratua izan da Information processing letters.
    Artikulua

    Scheduling chains to minimize mean flow time.
  10. 1630

    An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs. nork Chao, H.S

    Argitaratua izan da Information processing letters.
    Artikulua

    An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs.

Bilaketa egiteko lanabesak: