Showing 31 - 40 results of 85 for search '"Analysis of algorithms and problem complexity."', tempo de consulta: 0.01s Limitar resultados
  1. 31

    On clusterings good, bad and spectral. por Kannan, Ravi

    Publicado en Journal of the ACM
    Artigo

    On clusterings good, bad and spectral.
  2. 32

    Mobile routing for large scale all-IP wireless network. por Li, Hongyi

    Artigo

    Mobile routing for large scale all-IP wireless network.
  3. 33

    Routing and handoff in the edge mobility architecture. por O'Neill, Alan

    Artigo

    Routing and handoff in the edge mobility architecture.
  4. 34

    An approximate analysis of the shortest queue policy on soft real-time scheduling. por Zhu, Weiping

    Artigo

    An approximate analysis of the shortest queue policy on soft real-time scheduling.
  5. 35

    String analysis for x86 binaries. por Christodorescu, Mihai

    Artigo

    String analysis for x86 binaries.
  6. 36

    Practical aspects of DSS design for commodities transportation during special events. por Zacharias, Manousaridis

    Artigo

    Practical aspects of DSS design for commodities transportation during special events.
  7. 37

    Generating optimal distinguishing sequences with a model checker. por Robinson-Mallett, Christopher

    Artigo

    Generating optimal distinguishing sequences with a model checker.
  8. 38

    Some agent theory for the semantic web. por Fass, Leona F.

    Artigo

    Some agent theory for the semantic web.
  9. 39

    Strategic Directions in Computational Geometry. por Tamassia, Roberto

    Publicado en ACM computing surveys.
    Artigo

    Strategic Directions in Computational Geometry.
  10. 40

    Distributed, scalable routing based on link-state vectors. por Behrens, Jochen

    Artigo

    Distributed, scalable routing based on link-state vectors.

Ferramentas de procura: