323 search results - page 38 / 65 » The Fault Tolerance of NP-Hard Problems |
185
click to vote
HPDC
2007
IEEE
16 years 14 days ago
2007
IEEE
Fine-Grained Cycle Sharing (FGCS) systems aim at utilizing the large amount of idle computational resources available on the Internet. Such systems allow guest jobs to run on a ho...
169
click to vote
CCE
2008
15 years 6 months ago
2008
This work considers the problem of control of nonlinear process systems subject to input constraints and actuator faults. Faults are considered that preclude the possibility of con...
239
click to vote
HCW
2000
IEEE
15 years 10 months ago
2000
IEEE
Management of large-scale parallel and distributed applications is an extremely complex task due to factors such as centralized management architectures, lack of coordination and ...
158
click to vote
HPDC
2008
IEEE
16 years 18 days ago
2008
IEEE
Grid applications have been prone to encountering problems such as failures or malicious attacks during execution, due to their distributed and large-scale features. The applicati...
147
click to vote
SPAA
2003
ACM
15 years 11 months ago
2003
ACM
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...