Dangos 1 - 10 canlyniadau o 85 ar gyfer chwilio '"Analysis of algorithms and problem complexity."', amser ymholiad: 0.02e Mireinio'r Canlyniadau
  1. 1

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

    Erthygl

    The calculus formally known as pi.
  2. 2

    Disjunctive datalog. gan Eiter, Thomas

    Erthygl

    Disjunctive datalog.
  3. 3

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

    Erthygl

    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. gan Shenker, Scott

    Erthygl

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

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

    Erthygl

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

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

    Erthygl

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

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

    Erthygl

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

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

    Erthygl

    Routing reserved bandwith multi-point connections.
  9. 9

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

    Erthygl

    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. gan Zhang, Zhi-Li

    Erthygl

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

Offerynnau Chwilio: