Sciweavers

6229 search results - page 94 / 1246
» Models of Computation for Networks on Chip
Sort
View
WDAG
2001
Springer
76views Algorithms» more  WDAG 2001»
14 years 1 months ago
An Effective Characterization of Computability in Anonymous Networks
We provide effective (i.e., recursive) characterizations of the relations that can be computed on networks where all processors use the same algorithm, start from the same state, a...
Paolo Boldi, Sebastiano Vigna
IJCNN
2007
IEEE
14 years 3 months ago
Computational Templates, Neural Network Dynamics, and Symbolic Logic
— The relationship between subsymbolic neural networks and symbolic logical systems is discussed from the point of view of the account of computational science by Paul Humphreys ...
Otto Lappi
PODC
1999
ACM
14 years 1 months ago
Computing Anonymously with Arbitrary Knowledge
We provide characterizations of the relations that can be computed with arbitrary knowledge on networks where all processors use the same algorithm and start from the same state (...
Paolo Boldi, Sebastiano Vigna
DATE
2007
IEEE
173views Hardware» more  DATE 2007»
14 years 3 months ago
Analytical router modeling for networks-on-chip performance analysis
Networks-on-Chip (NoCs) have recently emerged as a scalable alternative to classical bus and point-to-point architectures. To date, performance evaluation of NoC designs is largel...
Ümit Y. Ogras, Radu Marculescu
ICANN
2010
Springer
13 years 9 months ago
Computational Properties of Probabilistic Neural Networks
We discuss the problem of overfitting of probabilistic neural networks in the framework of statistical pattern recognition. The probabilistic approach to neural networks provides a...
Jiri Grim, Jan Hora