Sentence examples for paths and network from inspiring English sources

Topics: linear program duality and LP solvers; integer programming; combinatorial optimization problems on networks including minimum spanning trees, shortest paths, and network flows; matching and assignment problems; dynamic programming; linear approximations to convex programs; NP-completeness.

In order to reduce the number of redundant packets without affecting the transmission reliability, the packets of group C are coded further at special ratio by network coding as shareable redundant packets according to the link error, and a reliable transport protocol TPNC (twin path and network coding) based on two paths and network coding is proposed in this paper.

To study this relation, the network architecture can be characterized by graph topological characteristics such as shortest paths and network hubs.

To address this issue, in this paper we first develop a queuing network model that predicts the residual capacity of network paths, and identifies network bottlenecks.

At the path and network levels, the problem of capacity assignment with soft maximum waiting time guarantees is formulated as an optimization problem in order to obtain minimized values of the link capacities.

MPNC (multiple path and network coding) is proposed as a reliable transport protocol for UWASN (underwater acoustic sensor network).

In order to reduce data transmission overhead, the packets of group C are coded further at special ratio by network coding as shareable redundant packet according to the link error, and TPNC (twin path and network coding) is proposed in this paper.

Delay Tolerant Networks (DTNs) are characterized by very long delay paths and frequent network partitions.

The communication in a delay-tolerant networking architecture, which is characterized by very long delay paths and frequent network partitions, basically relies on asynchronous, store-carry-forward message delivery.

The presence of the graphene in composite not only constructed conductive paths and a network for fast transport of Li+, but also effectively reduced the dissolution of polysulfides into electrolyte.

As a crucial part of this concept, we investigate the tradeoff between the size of packet headers (needed to store end-to-end paths) and the network state (needed to store routing tables).