Showing 21 - 30 results of 97 for search '"Problem complexity."', query time: 0.02s Refine Results
  1. 21

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

    Article

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

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

    Article

    An analysis of BGP convergence properties.
  3. 23

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

    Article

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

    Making intra-domain routing robust to changing and uncertain traffic demands understanding fundamental tradeoffs. by Applegate, David

    Article

    Making intra-domain routing robust to changing and uncertain traffic demands understanding fundamental tradeoffs.
  5. 25

    An in-place sorting with O(nlog n) comparisons and O(n) moves. by Franceschini, Gianni

    Published in Journal of the ACM
    Article

    An in-place sorting with O(nlog n) comparisons and O(n) moves.
  6. 26

    Asymmetric k-center is log* n-hard to approximate. by Chuzhoy, Julia

    Published in Journal of the ACM
    Article

    Asymmetric k-center is log* n-hard to approximate.
  7. 27

    Boosting textual compression in optimal linear time. by Ferragina, Paolo

    Published in Journal of the ACM
    Article

    Boosting textual compression in optimal linear time.
  8. 28

    Edge-disjoint routing in plane switch graphs in linear time. by Hochstein, J.M

    Published in Journal of the ACM
    Article

    Edge-disjoint routing in plane switch graphs in linear time.
  9. 29

    A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. by Jerrum, Mark

    Published in Journal of the ACM
    Article

    A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
  10. 30

    Complexity estimates depending on condition and round-off error. by Cucker, Felipe

    Published in Journal of the ACM
    Article

    Complexity estimates depending on condition and round-off error.

Search Tools: