Sciweavers

3136 search results - page 159 / 628
» Complex networks and evolutionary computation
Sort
View
ICANN
2009
Springer
15 years 9 months ago
Computing with Probabilistic Cellular Automata
Abstract. We investigate the computational capabilities of probabilistic cellular automata by means of the density classification problem. We find that a specific probabilistic ...
Martin Schüle, Thomas Ott, Ruedi Stoop
NC
2011
201views Neural Networks» more  NC 2011»
14 years 11 months ago
The computational power of membrane systems under tight uniformity conditions
We apply techniques from complexity theory to a model of biological cellular membranes known as membrane systems or P-systems. Like Boolean circuits, membrane systems are defined ...
Niall Murphy, Damien Woods
DSN
2007
IEEE
15 years 10 months ago
Computing Battery Lifetime Distributions
The usage of mobile devices like cell phones, navigation systems, or laptop computers, is limited by the lifetime of the included batteries. This lifetime depends naturally on the...
Lucia Cloth, Marijn R. Jongerden, Boudewijn R. Hav...
CORR
2012
Springer
281views Education» more  CORR 2012»
14 years 5 days ago
Belief Propagation by Message Passing in Junction Trees: Computing Each Message Faster Using GPU Parallelization
Compiling Bayesian networks (BNs) to junction trees and performing belief propagation over them is among the most prominent approaches to computing posteriors in BNs. However, bel...
Lu Zheng, Ole J. Mengshoel, Jike Chong
ICDE
2005
IEEE
108views Database» more  ICDE 2005»
16 years 5 months ago
Range Efficient Computation of F0 over Massive Data Streams
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
Pavan Aduri, Srikanta Tirthapura