Liang-Jun Ke

Learn More
The set covering problem (SCP) is a well known NP-hard problem with many practical applications. In this research, a new approach based on ant colony optimization (ACO) is proposed to solve the SCP. The main differences between it and the existing ACO-based approaches lie in three aspects. First, it adopts a novel method, called single-row-oriented method,(More)
It is a developing trend that satellites are used to interconnect heterogeneous network in the field of satellite communication. Besides transmitting application data, inter-satellite links (ISLs) will be used to transmit satellite management data, such as telemetry and telecommand data. The ground stations are managing entity. In this paper, the typical(More)
  • 1