1639 search results - page 135 / 328 » Degree-constrained network flows |
137
click to vote
ICDCSW
2005
IEEE
15 years 10 months ago
2005
IEEE
The core problem in risk analysis - determining exploitable paths between attackers and system assets is essentially a problem of determining information flow. It is relatively st...
106
click to vote
DATE
2010
IEEE
15 years 8 months ago
2010
IEEE
We have proposed (, )-based flow regulation to reduce delay and backlog bounds in SoC architectures, where bounds the traffic burstiness and the traffic rate. The regulation is co...
147
click to vote
CC
2006
Springer
15 years 8 months ago
2006
Springer
We show that classic PRE is also a maximum flow problem, thereby revealing the missing link between classic and speculative PRE, and more importantly, establishing a common high-le...
128
click to vote
APPROX
2010
Springer
15 years 6 months ago
2010
Springer
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...
112
click to vote
COMCOM
2010
15 years 4 months ago
2010
A new method of estimating some statistical characteristics of TCP flows in the Internet is developed in this paper. For this purpose, a new set of random variables (referred to as...