1677 search results - page 168 / 336 » On the Completeness of Quantum Computation Models |
193
click to vote
BIRTHDAY
2008
Springer
15 years 8 months ago
2008
Springer
The Church-Turing Thesis has been the subject of many variations and interpretations over the years. Specifically, there are versions that refer only to functions over the natural ...
197
click to vote
LICS
1998
IEEE
15 years 10 months ago
1998
IEEE
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...
164
click to vote
SIROCCO
2008
15 years 8 months ago
2008
: A distributed system is scalable if the rate at which it completes its computation and communication tasks does not depend on its size. As an example, the scalability of a peer-t...
192
click to vote
AI
1999
Springer
15 years 6 months ago
1999
Springer
Intelligent systems are often called upon to form plans that direct their own or other agents' activities. For these systems, the ability to describe plans to people in natur...
182
click to vote
TCBB
2008
15 years 6 months ago
2008
The last several decades have witnessed a vast accumulation of biological data and data analysis. Many of these data sets represent only a small fraction of the system's behav...