Information theory inspired optimization algorithm for efficient service orchestration in distributed systems
Fig 26
Tour construction for a weighted graph with a probability function p ∈ [0,1].
Click through the PLOS taxonomy to find articles in your field.
For more information about PLOS Subject Areas, click here.
Tour construction for a weighted graph with a probability function p ∈ [0,1].