Sciweavers

500 search results - page 7 / 100
» Quantum computing: beyond the limits of conventional computa...
Sort
View
CHI
2001
ACM
14 years 7 months ago
Beyond command knowledge: identifying and teaching strategic knowledge for using complex computer applications
Despite experience, many users do not make efficient use of complex computer applications. We argue that this is caused by a lack of strategic knowledge that is difficult to acqui...
Suresh K. Bhavnani, Frederick Reif, Bonnie E. John
METAINFORMATICS
2004
Springer
14 years 25 days ago
Looking Beyond Computer Applications: Investigating Rich Structures
Spatial structure supporting applications offer an abstract level of what can be found in the real world. However, in many systems, objects are aligned straight, rotation is not p...
Claus Atzenbeck, Peter J. Nürnberg
ICALP
2005
Springer
14 years 1 months ago
All Quantum Adversary Methods Are Equivalent
Abstract: The quantum adversary method is one of the most versatile lower-bound methods for quantum algorithms. We show that all known variants of this method are equivalent: spect...
Robert Spalek, Mario Szegedy
ACSW
2006
13 years 9 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
ENTCS
2011
131views more  ENTCS 2011»
13 years 2 months ago
Computational Complexity in Non-Turing Models of Computation: The What, the Why and the How
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, ‘Computational Complexity in Non-Turing Models of Computationâ...
Ed Blakey