1951 search results - page 217 / 391 » An algorithm for improving graph partitions |
169
click to vote
ISAAC
2005
Springer
15 years 11 months ago
2005
Springer
Consider an information network with harmful procedures called attackers (e.g., viruses); each attacker uses a probability distribution to choose a node of the network to damage. O...
196
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
169
click to vote
STOC
2009
ACM
16 years 6 months ago
2009
ACM
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
153
click to vote
AAIM
2009
Springer
16 years 4 days ago
2009
Springer
We study restricted improvement cycles (ri-cycles) in finite positional n-person games with perfect information modeled by directed graphs (digraphs) that may contain cycles. We o...
167
click to vote
LCPC
2009
Springer
15 years 10 months ago
2009
Springer
This paper improves our previous research effort [1] by providing an efficient method for kernel loop unrolling minimisation in the case of already scheduled loops, where circular...