186 search results - page 18 / 38 » The Partial Augment-Relabel Algorithm for the Maximum Flow P... |
CGO
2003
IEEE
13 years 11 months ago
2003
IEEE
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
TON
2008
13 years 7 months ago
2008
Abstract-- It is very important to allocate and manage resources for multimedia traffic flows with real-time performance requirements in order to guarantee quality-of-service (QoS)...
ESA
2006
Springer
13 years 11 months ago
2006
Springer
This paper considers two similar graph algorithms that work by repeatedly increasing "flow" along "augmenting paths": the Ford-Fulkerson algorithm for the maxi...
TSP
2010
13 years 2 months ago
2010
The problem of detecting multi-hop information flows subject to communication constraints is considered. In a distributed detection scheme, eavesdroppers are deployed near nodes in...
ESA
2007
Springer
14 years 1 months ago
2007
Springer
In the single source unsplittable flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given digraph. The deman...