1677 search results - page 77 / 336 » On the Completeness of Quantum Computation Models |
110
click to vote
CCGRID
2006
IEEE
15 years 7 months ago
2006
IEEE
As the scale of cluster computing grows, it is becoming hard for long-running applications to complete without facing failures on large-scale clusters. To address this issue, chec...
DSN
2002
IEEE
15 years 6 months ago
2002
IEEE
Designing applications with timeliness requirements in environments of uncertain synchrony is known to be a difficult problem. In this paper, we follow the perspective of timing ...
94
Voted
AAAI
2008
15 years 3 months ago
2008
Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are P 2 hard. To overc...
121
Voted
COR
2006
15 years 1 months ago
2006
Numerical examples of a Braess-like paradox in which adding capacity to a distributed computer system may degrade the performance of all users in the system have been reported. Un...
ICIP
2008
IEEE
15 years 8 months ago
2008
IEEE
A new localized and computationally efficient approach is presented for shift/space-variant image restoration. Unlike conventional approaches, it models shift-variant blurring in...