160 search results - page 18 / 32 » Strongly Polynomial Algorithms for the Unsplittable Flow Pro... |
ASPDAC
2008
ACM
13 years 9 months ago
2008
ACM
Abstract-- We address performance maximization of independent task sets under energy constraint on chip multi-processor (CMP) architectures that support multiple voltage/frequency ...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
We study the problem of strong/weak bisimilarity between processes of one-counter automata and finite-state processes. We show that the problem of weak bisimilarity between process...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We pose and study the problem of Byzantine-robust topology discovery in an arbitrary asynchronous network. The problem straction of fault-tolerant routing. We formally state the we...
UAI
2004
13 years 9 months ago
2004
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
ICFP
2007
ACM
14 years 7 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...