Visas 1 - 10 av 61 resultat för sökning '"Nonnumerical algorithms and problems."', Sökningstid: 0,02s Förfina resultatet
  1. 1

    An overview of the new routing algorithm for the ARPANET. av McQuillan, John M.

    Artikel

    An overview of the new routing algorithm for the ARPANET.
  2. 2

    Making greed work in networks a game-theoretic analysis of switch service disciplines. av Shenker, Scott

    Artikel

    Making greed work in networks a game-theoretic analysis of switch service disciplines.
  3. 3

    Statistical analysis of generalized processor sharing scheduling discipline. av Zhang, Zi-Li

    Artikel

    Statistical analysis of generalized processor sharing scheduling discipline.
  4. 4

    On optimization of polling policy represented by neural network. av Matsumoto, Yutaka

    Artikel

    On optimization of polling policy represented by neural network.
  5. 5

    Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers. av Perkins, Charles E.

    Artikel

    Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers.
  6. 6

    Routing reserved bandwith multi-point connections. av Verma, Dinesh C.

    Artikel

    Routing reserved bandwith multi-point connections.
  7. 7

    Endpoint admission control architectural issues and performance. av Breslau, Lee

    Artikel

    Endpoint admission control architectural issues and performance.
  8. 8

    Decoupling QoS control from core routers a novel bandwidth broker architecture for scalable support of guaranteed services. av Zhang, Zhi-Li

    Artikel

    Decoupling QoS control from core routers a novel bandwidth broker architecture for scalable support of guaranteed services.
  9. 9

    An analysis of BGP convergence properties. av Griffin, Timothy G.

    Artikel

    An analysis of BGP convergence properties.
  10. 10

    Stratified round Robin a low complexity packet scheduler with bandwidth fairness and bounded delay. av Ramabhadran, Sriram

    Artikel

    Stratified round Robin a low complexity packet scheduler with bandwidth fairness and bounded delay.

Sökverktyg: