160 search results - page 17 / 32 » Strongly Polynomial Algorithms for the Unsplittable Flow Pro... |
AAIM
2007
Springer
14 years 2 months ago
2007
Springer
Given an undirected graph G = (V, E) and a weight function w : E → Z+ , we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all verti...
ISSTA
1998
ACM
14 years 22 hour ago
1998
ACM
Automated analyses for regression test selection (RTS) attempt to determine if a modified program, when run on a test t, will have the same behavior as an old version of the prog...
ADAEUROPE
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. In this paper we present algorithms to statically detect livelocks in Ada multitasking programs. Although the algorithms’ worst-case execution time is exponential, they...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
We consider the problem of randomness extraction from independent sources. We construct an extractor that can extract from a constant number of independent sources of length n, ea...
INFOCOM
2012
IEEE
11 years 10 months ago
2012
IEEE
—Cognitive Radio Networks allow unlicensed users to opportunistically access the licensed spectrum without causing disruptive interference to the primary users (PUs). One of the ...