A mostrar 71 - 80 resultados de 137 para a pesquisa '"Mathematics of Computing."', tempo de pesquisa: 0.03seg Refinar resultados
  1. 71

    How much can hardware help routing?. Por Borodin, Allan

    Publicado no Journal of the ACM
    Artigo

    How much can hardware help routing?.
  2. 72

    Time-work tradeoffs for parallel algorithms. Por Spencer, Thomas H.

    Publicado no Journal of the ACM
    Artigo

    Time-work tradeoffs for parallel algorithms.
  3. 73

    Polynomial-time data reduction for dominating set. Por Alber, Jochen

    Publicado no Journal of the ACM
    Artigo

    Polynomial-time data reduction for dominating set.
  4. 74

    Smoothed analysis of algorithms Why the simplex algorithm usually takes polynomial time. Por Spielman, Daniel A.

    Publicado no Journal of the ACM
    Artigo

    Smoothed analysis of algorithms Why the simplex algorithm usually takes polynomial time.
  5. 75

    Weighted coloring based channel assignment for WLANs. Por Mishra, Arunesh

    Artigo

    Weighted coloring based channel assignment for WLANs.
  6. 76

    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.
  7. 77

    IP-based services over GPRS. Por Chitre, Vikrant A.

    Artigo

    IP-based services over GPRS.
  8. 78

    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.
  9. 79

    Applying classification techniques to remotely-collected program execution data. Por Haran, Murali

    Artigo

    Applying classification techniques to remotely-collected program execution data.
  10. 80

    Correlation exploitation in error ranking. Por Kremenek, Ted

    Artigo

    Correlation exploitation in error ranking.

Ferramentas de pesquisa: