1677 search results - page 203 / 336 » On the Completeness of Quantum Computation Models |
167
click to vote
GPC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. One of the most important collective communication patterns used in scientific applications is the complete exchange, also called All-to-All. Although efficient algorithm...
200
click to vote
IPPS
2000
IEEE
15 years 10 months ago
2000
IEEE
Metacomputing infrastructures couple multiple clusters (or MPPs) via wide-area networks. A major problem in programming parallel applications for such platforms is their hierarchi...
186
click to vote
EDCC
2008
Springer
15 years 8 months ago
2008
Springer
This work addresses the problem of software fault diagnosis in complex safety critical software systems. The transient manifestations of software faults represent a challenging is...
162
click to vote
JSYML
2008
15 years 6 months ago
2008
In 2004 Csima, Hirschfeldt, Knight, and Soare [1] showed that a set A T 0 is nonlow2 if and only if A is prime bounding, i.e. for every complete atomic decidable theory T , there i...
158
click to vote
MP
2006
15 years 6 months ago
2006
We present a distribution-free model of incomplete-information games, both with and without private information, in which the players use a robust optimization approach to contend ...