20197 search results - page 54 / 4040 » Comparing Computational Power |
116
click to vote
LFCS
1992
Springer
15 years 6 months ago
1992
Springer
A generator program for a computable function (by definition) generates an infinite sequence of programs all but finitely many of which compute that function. Machine learning of ...
UC
2005
Springer
15 years 7 months 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 ...
115
click to vote
ISAAC
2005
Springer
15 years 7 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...
105
Voted
NIPS
2008
15 years 3 months ago
2008
Randomly connected recurrent neural circuits have proven to be very powerful models for online computations when a trained memoryless readout function is appended. Such Reservoir ...
131
Voted
IPPS
2003
IEEE
15 years 7 months ago
2003
IEEE
Power management has become popular in mobile computing as well as in server farms. Although a lot of work has been done to manage the energy consumption on uniprocessor real-time...