— Recent results on the control of linear systems subject to time-domain constraints could only handle the case of closed-loop poles that are situated on the real axis. As most c...
Wouter H. T. M. Aangenent, W. P. M. H. Heemels, M....
— We present an algorithm to calculate the control input when the processing resources available are time-varying. The basic idea is to calculate the components of the control in...
Abstract. Failure is an ordinary characteristic of large-scale distributed environments. Resubmission is a general strategy employed to cope with failures in grids. Here, we analyt...
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...
Predicting the incidence of faults in code has been commonly associated with measuring complexity. In this paper, we propose complexity metrics that are based on the code change p...