Отображение 221 - 230 результаты of 294 для поиска '"Discretion."', время запроса: 0.02сек. Отмена результатов
  1. 221

    Core based trees (CBT). по Ballardie, Tony

    Опубликовано в: Computer communication review.
    Статья

    Core based trees (CBT).
  2. 222

    Delayed Internet routing convergence. по Labovitz, Craig

    Опубликовано в: Computer communication review.
    Статья

    Delayed Internet routing convergence.
  3. 223

    STAR a transparent spanning tree bridge protocol with alternate routing. по Lui, King-Shan

    Опубликовано в: Computer communication review.
    Статья

    STAR a transparent spanning tree bridge protocol with alternate routing.
  4. 224

    The internet AS-level topology three data sources and one definitive metric. по Mahadevan, Priya

    Опубликовано в: Computer communication review.
    Статья

    The internet AS-level topology three data sources and one definitive metric.
  5. 225

    A distributed method to bound rollback lengths for fossil collection in time warp simulators. по Young, Christopher H.

    Опубликовано в: Information processing letters.
    Статья

    A distributed method to bound rollback lengths for fossil collection in time warp simulators.
  6. 226

    Almost tight upper bounds for vertical decompositions in four dimensions. по Koltun, Vladlen

    Опубликовано в: Journal of the ACM
    Статья

    Almost tight upper bounds for vertical decompositions in four dimensions.
  7. 227

    Lenses in arrangements of pseudo-circles and their applications. по Agarwal, Pankaj K.

    Опубликовано в: Journal of the ACM
    Статья

    Lenses in arrangements of pseudo-circles and their applications.
  8. 228

    An efficient algorithm for image segmentation, Markov random fields and related problems. по Hochbaum, Dorit S.

    Опубликовано в: Journal of the ACM
    Статья

    An efficient algorithm for image segmentation, Markov random fields and related problems.
  9. 229

    Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. по Holm, Jacob

    Опубликовано в: Journal of the ACM
    Статья

    Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity.
  10. 230

    A combinatorial strongly polynomial algorithm for minimizing submodular functions. по Iwata, Satoru

    Опубликовано в: Journal of the ACM
    Статья

    A combinatorial strongly polynomial algorithm for minimizing submodular functions.

Инструменты поиска: