33356 search results - page 237 / 6672 » Models of Continual Computation |
148
click to vote
UC
2005
Springer
16 years 10 hour ago
2005
Springer
We present lower bounds on the computational power of an optical model of computation called the C2-CSM. We show that C2-CSM time is at least as powerful as sequential space, thus ...
180
click to vote
ENTCS
2011
15 years 1 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â...
161
click to vote
ISAAC
2005
Springer
16 years 1 days 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...
131
click to vote
AISS
2010
15 years 4 months ago
2010
In this paper, we propose the computation model for computing an Inter-layer path based on PCE. Comparing the performance of these various models, we wanna propose the model that ...
169
click to vote
JUCS
2010
15 years 5 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...