290 search results - page 4 / 58 » Balancing Applied to Maximum Network Flow Problems |
CC
2006
Springer
13 years 11 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...
TAMC
2009
Springer
14 years 1 months ago
2009
Springer
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
RTSS
1998
IEEE
13 years 11 months ago
1998
IEEE
suitable disk layout and network transmission schedule to minimize allocated resources (buffer size, bandwidth, ..., etc.) with maximum resource utilization. In this paper, the rea...
NETCOOP
2009
Springer
14 years 1 months ago
2009
Springer
We study the impact of user association policies on flow-level performance in interference limited wireless networks. Most research in this area has used static interference model...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...