1677 search results - page 162 / 336 » On the Completeness of Quantum Computation Models |
199
click to vote
CA
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper shows a new approach to model and control interactive objects for simulations with virtual human agents when real time interactivity is essential. A general conceptuali...
175
click to vote
ARTS
1999
Springer
15 years 11 months ago
1999
Springer
Published results show that various models may be obtained by combining parallel composition with probability and with or without non-determinism. In this paper we treat this probl...
164
click to vote
JC
2008
15 years 6 months ago
2008
Valiant introduced 20 years ago an algebraic complexity theory to study the complexity of polynomial families. The basic computation model used is the arithmetic circuit, which ma...
210
click to vote
ICSOC
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Service-based systems should be able to dynamically seek replacements for faulty or underperforming services, thus performing self-healing. It may however be the case tha...
177
click to vote
MFCS
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We initiate a purely algebraic study of Ehrhard and Regnier’s resource λ-calculus, by introducing three equational classes of algebras: resource combinatory algebras, ...