1677 search results - page 61 / 336 » On the Completeness of Quantum Computation Models |
103
click to vote
AI
2004
Springer
15 years 1 months ago
2004
Springer
We study coalitional games in which agents are each assumed to have a goal to be achieved, and where the characteristic property of a coalition is a set of choices, with each choi...
103
click to vote
CRYPTO
2011
Springer
14 years 1 months ago
2011
Springer
Abstract. A time-lock puzzle is a mechanism for sending messages “to the future”. The sender publishes a puzzle whose solution is the message to be sent, thus hiding it until e...
110
click to vote
RTSS
2006
IEEE
15 years 7 months ago
2006
IEEE
In most operating systems, the handling of interrupts is typically performed within the address space of the kernel. Moreover, interrupt handlers are invoked asynchronously during...
111
click to vote
ICPR
2004
IEEE
16 years 2 months ago
2004
IEEE
Parallel processors such as SIMD computers have been successfully used in various areas of high performance image and data processing. Due to their characteristics of highly regula...
104
click to vote
CIE
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...