1594 search results - page 259 / 319 » An Algorithm to Compute Collusion Paths |
117
click to vote
ESA
2007
Springer
15 years 9 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...
113
click to vote
INFOCOM
2006
IEEE
15 years 9 months ago
2006
IEEE
— The need to monitor real time network services has prompted service providers to use new measurement technologies, such as service-specific probes. Service-specific probes ar...
122
click to vote
ICALP
2003
Springer
15 years 8 months ago
2003
Springer
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
114
click to vote
FPGA
1997
ACM
15 years 7 months ago
1997
ACM
In this paper, we give a necessary and sufficient condition for the existence of partially-dependent functional decomposition and develop new algorithms to compute such decomposi...
122
click to vote
ASAP
2004
IEEE
15 years 6 months ago
2004
IEEE
Decreasing feature sizes allow additional functionality to be added to future microprocessors to improve the performance of important application domains. As a result of rapid gro...