Sciweavers

7486 search results - page 144 / 1498
» The Limits of Quantum Computers
Sort
View
ICALP
2003
Springer
15 years 11 months ago
A Direct Sum Theorem in Communication Complexity via Message Compression
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
SPAA
2003
ACM
15 years 11 months ago
A proportionate fair scheduling rule with good worst-case performance
In this paper we consider the following scenario. A set of n jobs with different threads is being run concurrently. Each job has an associated weight, which gives the proportion ...
Micah Adler, Petra Berenbrink, Tom Friedetzky, Les...
CORR
2007
Springer
100views Education» more  CORR 2007»
15 years 6 months ago
Interference Automata
We propose a computing model, the Two-Way Optical Interference Automata (2OIA), that makes use of the phenomenon of optical interference. We introduce this model to investigate th...
M. V. Panduranga Rao
IPPS
2002
IEEE
15 years 11 months ago
A Performance Optimization Framework for Compilation of Tensor Contraction Expressions into Parallel Programs
This paper discusses a program synthesis system to facilitate the generation of high-performance parallel programs for a class of computations encountered in quantum chemistry and...
Gerald Baumgartner, David E. Bernholdt, Daniel Coc...
ACSW
2006
15 years 7 months ago
An agent-based peer-to-peer grid computing architecture: convergence of grid and peer-to-peer computing
The conventional computing Grid has developed a service oriented computing architecture with a superlocal resource management and scheduling strategy. This architecture is limited...
Jia Tang, Minjie Zhang