266 search results - page 30 / 54 » Can Saturation Be Parallelised |
AUTOMATICA
2004
13 years 7 months ago
2004
We study linear anti-windup augmentation for linear control systems with saturated linear plants in the special case when the anti-windup compensator can only modify the input and...
JCT
2011
13 years 2 months ago
2011
We prove a strong version of the the Max-Flow Min-Cut theorem for countable networks, namely that in every such network there exist a flow and a cut that are “orthogonal” to e...
ISVC
2007
Springer
14 years 1 months ago
2007
Springer
Optical motion capture can be classified as an inference problem: given the data produced by a set of cameras, the aim is to extract the hidden state, which in this case encodes t...
RTCSA
2007
IEEE
14 years 1 months ago
2007
IEEE
A task that suspends itself to wait for an I/O completion or to wait for an event from another node in distributed environments is called an I/O blocking task. In conventional har...
TRANSCI
1998
13 years 7 months ago
1998
This paper explores some of the traffic phenomena that arise when drivers have to navigate a network in which queues back up past diverge intersections. If a diverge provides two ...