Näytetään 31 - 40 yhteensä 61 tuloksesta haulle '"Nonnumerical algorithms and problems."', hakuaika: 0,01s Tarkenna hakua
  1. 31

    Dynamics of internet routing information. Tekijä Chinoy, Bilal

    Artikkeli

    Dynamics of internet routing information.
  2. 32

    Open shortest path first (OSPF) routing protocol simulation. Tekijä Sidhu, Deepinder

    Artikkeli

    Open shortest path first (OSPF) routing protocol simulation.
  3. 33

    Core based trees (CBT). Tekijä Ballardie, Tony

    Artikkeli

    Core based trees (CBT).
  4. 34

    Routing stability in congested networks experimentation and analysis. Tekijä Shaikh, Aman

    Artikkeli

    Routing stability in congested networks experimentation and analysis.
  5. 35

    Delayed Internet routing convergence. Tekijä Labovitz, Craig

    Artikkeli

    Delayed Internet routing convergence.
  6. 36

    Packet classification using tuple space search. Tekijä Srinivasan, V.

    Artikkeli

    Packet classification using tuple space search.
  7. 37

    Routing with a clue. Tekijä Bremler-Barr, Anat

    Artikkeli

    Routing with a clue.
  8. 38

    Indexing compressed text. Tekijä Ferragina, Paolo

    Julkaisussa Journal of the ACM
    Artikkeli

    Indexing compressed text.
  9. 39

    Source routing and scheduling in packet networks. Tekijä Andrews, Matthew

    Julkaisussa Journal of the ACM
    Artikkeli

    Source routing and scheduling in packet networks.
  10. 40

    Resolution lower bounds for the weak pigeonhole principle. Tekijä Raz, R.

    Julkaisussa Journal of the ACM
    Artikkeli

    Resolution lower bounds for the weak pigeonhole principle.

Työkalut: