5981 search results - page 220 / 1197 » time 2006 |
133
click to vote
JSA
2000
15 years 4 months ago
2000
In (2n)1)-stage rearrangeable networks, the routing time for any arbitrary permutation is X(n2 ) compared to its propagation delay O(n) only. Here, we attempt to identify the sets...
130
click to vote
ORL
2007
15 years 3 months ago
2007
Polling systems with large deterministic setup times find many applications in production environments. The present note studies the delay distribution in exhaustive polling syst...
112
click to vote
IJON
2007
15 years 4 months ago
2007
A biophysical cortico-colicular model of saccade initiation based on competitive integration of planned and reactive cortical saccade decision signals in the intermediate layer of...
126
click to vote
IJON
2002
15 years 4 months ago
2002
: A new supervised learning procedure for training RBF networks is proposed. It uses a pair of parallel running Kalman filters to sequentially update both the output weights and th...
136
click to vote
IPL
2010
15 years 2 months ago
2010
We deal with the problem of deciding whether a given set of string patterns implies the presence of a fixed pattern. While checking whether a set of patterns occurs in a string i...