• Conference Object  

      Decentralised minimum-time average consensus in digraphs 

      Charalambous, T.; Yuan, Y.; Yang, T.; Pan, W.; Hadjicostis, Christoforos N.; Johansson, M. (Institute of Electrical and Electronics Engineers Inc., 2013)
      Distributed algorithms for average consensus in directed graphs are typically asymptotic in the literature. In this work, we propose a protocol to distributively reach average consensus in a finite number of steps on ...
    • Conference Object  

      Low-complexity max-product algorithms for problems of multiple fault diagnosis 

      Le, T.; Hadjicostis, Christoforos N. (2008)
      In this paper, we propose low-complexity max-product algorithms for the problem of multiple fault diagnosis (MFD). The MFD problem is described by a bipartite diagnosis graph (BDG) which consists of a set of components, a ...