7200 search results - page 108 / 1440 » On the Computational Power of Winner-Take-All |
CIE
2010
Springer
14 years 1 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...
EUC
2006
Springer
14 years 1 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 ...
ENTCS
2002
13 years 9 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 ...
ECAL
2005
Springer
14 years 3 months 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...
HPCS
2005
IEEE
14 years 3 months 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...