Sciweavers

25 search results - page 4 / 5
» Can Dataflow Subsume von Neumann Computing
Sort
View
DMSN
2004
ACM
13 years 11 months ago
Approximately uniform random sampling in sensor networks
Recent work in sensor databases has focused extensively on distributed query problems, notably distributed computation of aggregates. Existing methods for computing aggregates bro...
Boulat A. Bash, John W. Byers, Jeffrey Considine
IPPS
2009
IEEE
14 years 27 days ago
Adaptative clustering Particle Swarm Optimization
—The performance of Particle Swarm Optimization (PSO) algorithms depends strongly upon the interaction among the particles. The existing communication topologies for PSO (e.g. st...
Salomão S. Madeiro, Carmelo J. A. Bastos Fi...

Publication
303views
12 years 4 months ago
Evolutionary synthesis of analog networks
he significant increase in the available computational power that took place in recent decades has been accompanied by a growing interest in the application of the evolutionary ap...
Claudio Mattiussi
IV
2007
IEEE
149views Visualization» more  IV 2007»
14 years 16 days ago
Information Visualization of Multi-dimensional Cellular Automata using GPU Programming
We propose a method for generating all possible rules of multidimension Boolean cellular automata (CA). Based on an original encoding method and the programming of graphical proce...
Stéphane Gobron, Daniel Mestre
CIE
2007
Springer
13 years 10 months ago
A Classification of Viruses Through Recursion Theorems
We study computer virology from an abstract point of view. Viruses and worms are self-replicating programs, whose constructions are essentially based on Kleene's second recurs...
Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves ...