7200 search results - page 108 / 1440 » On the Computational Power of Winner-Take-All |
174
Voted
CIE
2010
Springer
15 years 11 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
184
click to vote
EUC
2006
Springer
15 years 10 months ago
2006
Springer
Wireless sensor networks and Radio Frequency Identifiers are becoming mainstream applications of ubiquitous computing. They are slowly being integrated into our infrastructure and ...
190
Voted
ENTCS
2002
15 years 6 months ago
2002
Non-deterministic computations greatly enhance the expressive power of functional logic programs, but are often computationally expensive. We analyze a programming technique that ...
159
click to vote
ECAL
2005
Springer
16 years 15 days ago
2005
Springer
We propose a biologically and physically plausible model for ants and pheromones, and show this model to be sufficiently powerful to simulate the computation of arbitrary logic cir...
199
Voted
HPCS
2005
IEEE
16 years 17 days ago
2005
IEEE
Abstract— In recent years our society has witnessed an unprecedented growth in computing power available to tackle important problems in science, engineering and medicine. For ex...