Näytetään 1 - 10 yhteensä 85 tuloksesta haulle '"Analysis of algorithms and problem complexity."', hakuaika: 0,02s Tarkenna hakua
  1. 1

    The calculus formally known as pi. Tekijä Kelly-Bootle, Stan

    Artikkeli

    The calculus formally known as pi.
  2. 2

    Disjunctive datalog. Tekijä Eiter, Thomas

    Artikkeli

    Disjunctive datalog.
  3. 3

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

    Artikkeli

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

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

    Artikkeli

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

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

    Artikkeli

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

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

    Artikkeli

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

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

    Artikkeli

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

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

    Artikkeli

    Routing reserved bandwith multi-point connections.
  9. 9

    Endpoint admission control architectural issues and performance. Tekijä Breslau, Lee

    Artikkeli

    Endpoint admission control architectural issues and performance.
  10. 10

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

    Artikkeli

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

Työkalut: