1145 search results - page 120 / 229 » Discrete Green's Functions |
128
click to vote
SCL
2008
15 years 6 months ago
2008
We observe that successive applications of known results from the theory of positive systems lead to an efficient general algorithm for positive realizations of transfer functions...
161
click to vote
AUTOMATICA
2004
15 years 6 months ago
2004
In this paper, we consider a deterministic timed continuous Petri net model where conflicts at places are solved by using stationary routing parameters. We show how to compute the...
132
click to vote
COMPSEC
2000
15 years 6 months ago
2000
Peyravian and Zunic (2000) proposed a password transmission scheme and a password change scheme over an insecure network. Their proposed solutions do not require the use of any sym...
126
click to vote
COMBINATORICS
1998
15 years 6 months ago
1998
The Galois number Gn(q) is defined to be the number of subspaces of the n-dimensional vector space over the finite field GF(q). When q is prime, we prove that Gn(q) is equal to...
234
click to vote
AISS
2010
15 years 3 months ago
2010
Aiming at the task allocation in multi-target tracking of wireless sensor networks, the discrete particle swarm optimization based on nearest-neighbor is presented to reduce the c...