29082 search results - page 21 / 5817 » The Time-Triggered Model of Computation |
ENTCS
2011
13 years 2 months ago
2011
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â...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
We present upper bounds on the computational power of an optical model of computation called the C2-CSM. We show that C2-CSM time is no more powerful than sequential space, thus gi...
JUCS
2010
13 years 6 months ago
2010
: For many complex and dynamic ubiquitous services, context-aware cooperation can be a solution. However, the way is not yet clear to make individual objects cooperate with each ot...
HASE
2008
IEEE
14 years 2 months ago
2008
IEEE
Due to the large number of attacks on open networks, information theft becomes a more and more severe problem. Secure computation can offer highly assured confidentiality protecti...
BICOB
2010
Springer
14 years 21 days ago
2010
Springer