18090 search results - page 273 / 3618 » Computing by Only Observing |
179
click to vote
CIE
2005
Springer
16 years 2 days ago
2005
Springer
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length ω to computations on tapes of arbitrary ordinal length. The general...
184
click to vote
ICLP
2009
Springer
16 years 1 months ago
2009
Springer
The seemingly simple choice of whether to use call variance or call subsumption in a tabled evaluation deeply affects an evaluation’s properties. Most tabling implementations hav...
172
click to vote
STOC
1994
ACM
15 years 10 months ago
1994
ACM
Shannon's Coding Theorem shows that in order to reliably transmit a message of T bits over a noisy communication channel, only a constant slowdown factor is necessary in the ...
168
click to vote
ITCC
2005
IEEE
16 years 3 days ago
2005
IEEE
This paper presents a service-based grid computing model which emphasizes that a grid is a special computing system. By comparing this model with the traditional computing system ...
158
click to vote
IJCNN
2008
IEEE
16 years 28 days ago
2008
IEEE
— Many applications of Reservoir Computing (and other signal processing techniques) have to deal with information processing of signals with multiple time-scales. Classical Reser...