1119 search results - page 58 / 224 » Computing in the Presence of Timing Failures |
EUROPAR
2007
Springer
14 years 1 months ago
2007
Springer
In many network applications the computation takes place on the minimum-cost spanning tree (MST) of the network; unfortunately, a single link or node failure disconnects the tree. ...
NCA
2006
IEEE
14 years 3 months ago
2006
IEEE
Modern distributed information systems handle increasingly critical data and computation, but there is no systematic way to assess whether a given part of the system can be entrus...
ISCAS
2007
IEEE
14 years 3 months ago
2007
IEEE
— We propose a computationally efficient method based on nonlinear optimization to identify critical lines, failure of which can cause severe blackouts. Our method computes crit...
SCCC
2007
IEEE
14 years 3 months ago
2007
IEEE
There is no doubt about the increase in popularity of decentralised systems over the classical client-server architecture in distributed applications. These systems are developed ...
ISCC
2005
IEEE
14 years 2 months ago
2005
IEEE
The paper presents a novel protection methodology for setting protected paths in a multiservice GMPLSbased network scenario. By applying the proposed methods, label switched paths...