Sciweavers

6251 search results - page 385 / 1251
» Randomness, Computability, and Density
Sort
View
JPDC
2008
129views more  JPDC 2008»
15 years 6 months ago
A framework for scalable greedy coloring on distributed-memory parallel computers
We present a scalable framework for parallelizing greedy graph coloring algorithms on distributed-memory computers. The framework unifies several existing algorithms and blends a ...
Doruk Bozdag, Assefaw Hadish Gebremedhin, Fredrik ...
NN
2008
Springer
114views Neural Networks» more  NN 2008»
15 years 6 months ago
Event detection and localization for small mobile robots using reservoir computing
Reservoir Computing (RC) techniques use a fixed (usually randomly created) recurrent neural network, or more generally any dynamic system, which operates at the edge of stability,...
Eric A. Antonelo, Benjamin Schrauwen, Dirk Strooba...
ALIFE
1998
15 years 6 months ago
Computational Models for the Formation of Protocell Structures
There have been various attempts to simulate the self-assembly process of lipid aggregates by computers. However, due to the computationally complex nature of the problem, previou...
Linglan Edwards, Yun Peng, James A. Reggia
NECO
2010
147views more  NECO 2010»
15 years 5 months ago
Connectivity, Dynamics, and Memory in Reservoir Computing with Binary and Analog Neurons
Abstract: Reservoir Computing (RC) systems are powerful models for online computations on input sequences. They consist of a memoryless readout neuron which is trained on top of a ...
Lars Büsing, Benjamin Schrauwen, Robert A. Le...
GECCO
2011
Springer
240views Optimization» more  GECCO 2011»
14 years 10 months ago
Collisions are helpful for computing unique input-output sequences
Computing unique input-output sequences (UIOs) from finite state machines (FSMs) is important for conformance testing in software engineering, where evolutionary algorithms (EAs)...
Chao Qian, Yang Yu, Zhi-Hua Zhou