Many real problems can be modelled as robust shortest path problems on digraphs with interval costs, where intervals represent uncertainty about real costs and a robust path is not...
Optimizing programs at run-time provides opportunities to apply aggressive optimizations to programs based on information that was not available at compile time. At run time, prog...
This paper investigates the task of identifying frequently-used pathways from video sequences of natural outdoor scenes. Path models are adaptively learnt from the accumulation of...
A new accurate mathematical analysis is presented for the efficient computation of the spectral efficiency of CDMA downlink wireless communication systems in the presence of multip...
Abstract—Dynamic routing has been adopted in circuit-switched networks in many parts of the world. Most of the routing algorithms used are least loaded routing (LLR) based for it...
Eric W. M. Wong, Andy K. M. Chan, Tak-Shing Peter ...