1594 search results - page 21 / 319 » An Algorithm to Compute Collusion Paths |
STACS
2010
Springer
15 years 6 months ago
2010
Springer
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
83
Voted
ESCIENCE
2007
IEEE
15 years 6 months ago
2007
IEEE
Effective scheduling is a key concern for the execution of performance driven Grid applications. In this paper, we propose a Dynamic Critical Path (DCP) based workflow scheduling ...
IWPEC
2009
Springer
15 years 6 months ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
119
click to vote
IEICET
2010
14 years 9 months ago
2010
This paper deals with the maximum-weight 2-path packing problem (M2PP), which is the problem of computing a set of vertex-disjoint paths of length 2 in a given edge-weighted compl...
ICPR
2008
IEEE
15 years 6 months ago
2008
IEEE
In the solution path algorithm of support vector regression, the penalty for violation of the required error is considered equally for every training sample, which means every tra...