Sciweavers

29082 search results - page 409 / 5817
» The Time-Triggered Model of Computation
Sort
View
GECCO
2007
Springer
174views Optimization» more  GECCO 2007»
15 years 10 months ago
Classifier systems that compute action mappings
The learning in a niche based learning classifier system depends both on the complexity of the problem space and on the number of available actions. In this paper, we introduce a ...
Pier Luca Lanzi, Daniele Loiacono
177
Voted
APPINF
2003
15 years 8 months ago
Preventing Computational Chaos in Asynchronous Neural Networks
One of the primary advantages of artificial neural networks is their inherent ability to perform massively parallel, nonlinear signal processing. However, the asynchronous dynamics...
Jacob Barhen, Vladimir Protopopescu
JPDC
2006
106views more  JPDC 2006»
15 years 6 months ago
Computing nearest neighbors in real time
The nearest-neighbor method can successfully be applied to correct possible errors induced into bit strings transmitted over noisy communication channels or to classify samples in...
Marius Nagy, Selim G. Akl
CORR
2011
Springer
205views Education» more  CORR 2011»
15 years 1 months ago
On the algebraic numbers computable by some generalized Ehrenfest urns
This article deals with some stochastic population protocols, motivated by theoretical aspects of distributed computing. We modelize the problem by a large urn of black and white ...
Marie Albenque, Lucas Gerin
TCC
2005
Springer
88views Cryptology» more  TCC 2005»
16 years 9 days ago
Relaxing Environmental Security: Monitored Functionalities and Client-Server Computation
Definition of security under the framework of Environmental Security (a.k.a Network-Aware Security or Universally Composable Security) typically requires “extractability” of t...
Manoj Prabhakaran, Amit Sahai