Computing Minimal Update Sequences for Graceful Router-Wide Reconfigurations

IEEE/ACM Transactions on Networking - United States
doi 10.1109/tnet.2014.2332101
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Related search

Minimal Mutation Trees of Sequences

SIAM Journal on Applied Mathematics
Applied Mathematics
1975English

A Convex Relaxation Approach for Computing Minimal Partitions

2009English

Detection of Abnormal Router Behaviour in a Wide Area Network.

English

An Algorithm for Computing Minimal Bidirectional Linear Recurrence Relations

IEEE Transactions on Information Theory
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
2009English

Computing Minimal Mappings Between Lightweight Ontologies

International Journal on Digital Libraries
LibraryInformation Sciences
2012English

Comparison and Improvement of Algorithms for Computing Minimal Cut Sets

BMC Bioinformatics
BiochemistryApplied MathematicsComputer Science ApplicationsStructural BiologyMolecular Biology
2013English

Minimal Genome-Wide Human CRISPR-Cas9 Library

2019English

The Minimal Dependency Relation for Causal Event Ordering in Distributed Computing

Applied Mathematics and Information Sciences
Numerical AnalysisApplied MathematicsAnalysisComputer Science ApplicationsMathematicsComputational Theory
2015English

ALICE Computing Update Before Start of RUN2

Computer Research and Modeling
Computational TheorySimulationComputer Science ApplicationsModelingMathematics
2015English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy