1594 search results - page 3 / 319 » An Algorithm to Compute Collusion Paths |
INFOCOM
2003
IEEE
14 years 20 days ago
2003
IEEE
— There is a growing interest among service providers to offer new services with Quality of Service (QoS) guaranties that are also resilient to failures. Supporting QoS connectio...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
A recent study characterizing failures in computer networks shows that transient single element (node/link) failures are the dominant failures in large communication networks like...
GIS
2007
ACM
14 years 8 months ago
2007
ACM
IJFCS
2007
13 years 7 months ago
2007
The longest path problem is to find a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigat...
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
This paper describes a new parallel algorithm for Minimum Cost Path computation on the Polymorphic Processor Array, a massively parallel architecture based on a reconfigurable mesh...