Sciweavers

170 search results - page 2 / 34
» On computational properties of chains of recurrences
Sort
View
DSN
2008
IEEE
14 years 1 months ago
A recurrence-relation-based reward model for performability evaluation of embedded systems
Embedded systems for closed-loop applications often behave as discrete-time semi-Markov processes (DTSMPs). Performability measures most meaningful to iterative embedded systems, ...
Ann T. Tai, Kam S. Tso, William H. Sanders
ISCAS
2006
IEEE
143views Hardware» more  ISCAS 2006»
14 years 1 months ago
Dynamic computation in a recurrent network of heterogeneous silicon neurons
Abstract—We describe a neuromorphic chip with a twolayer excitatory-inhibitory recurrent network of spiking neurons that exhibits localized clusters of neural activity. Unlike ot...
Paul Merolla, Kwabena Boahen
GECCO
2005
Springer
108views Optimization» more  GECCO 2005»
14 years 26 days ago
Evolving recurrent models using linear GP
Turing complete Genetic Programming (GP) models introduce the concept of internal state, and therefore have the capacity for identifying interesting temporal properties. Surprisin...
Xiao Luo, Malcolm I. Heywood, A. Nur Zincir-Heywoo...
APN
2005
Springer
14 years 27 days ago
The (True) Concurrent Markov Property and Some Applications to Markov Nets
Abstract. We study probabilistic safe Petri nets, a probabilistic extension of safe Petri nets interpreted under the true-concurrent semantics. In particular, the likelihood of pro...
Samy Abbes
ISSAC
1999
Springer
86views Mathematics» more  ISSAC 1999»
13 years 11 months ago
How Fast Can We Compute Products?
In this paper we consider the problem of fast computation of n-ary products, for large n, over arbitrary precision integer or rational number domains. The combination of loop unro...
V. Kislenkov, V. Mitrofanov, Eugene V. Zima