3229 search results - page 164 / 646 » The Theory of Timed Automata |
193
click to vote
ICA
2010
Springer
15 years 5 months ago
2010
Springer
One potential strength of recurrent neural networks (RNNs) is their – theoretical – ability to find a connection between cause and consequence in time series in an constraint-...
146
click to vote
BCSHCI
2008
15 years 8 months ago
2008
Computing technology is now so entwined with everyday life that enquiries into human computer interaction (HCI) are also studies of society and culture Cultural and Critical theor...
154
click to vote
ISNN
2005
Springer
16 years 14 hour ago
2005
Springer
This paper considers the robust stability of neural networks with multiple delays. Based on Lyapunov stability theory and linear matrix inequality technique, some new delay indepe...
158
click to vote
VLSID
1994
IEEE
15 years 10 months ago
1994
IEEE
In this paper, we present a formal analysis of the constraints of the scheduling problem, and evaluate the structure of the scheduling polytope described by those constraints. Pol...
169
click to vote
BIRTHDAY
2010
Springer
15 years 7 months ago
2010
Springer
In the early 1920s, Pavel Urysohn proved his famous lemma (sometimes referred to as "first non-trivial result of point set topology"). Among other applications, this lemm...