Search

Consider a multipriority batch computer system which users from several different classes may join, with toll, service, and waiting charges. Such a system is formulated here as a semi- Markov decision process, In which the aim of arriving users Is to minimize their expected loss. The optimal joining policy of arriving users who may join the system at some of its queues is a control limit policy, with a single control number for any possible queue and the user's class; a newly arriving user will join a queue that is not filled up to the control number corresponding to this queue and the user's class. In this paper control numbers, as well as lower and upper bounds for the control numbers and the capacities of the system's queues, are derived. [ABSTRACT FROM AUTHOR]

Since complex network theory was first put forward, the search issue for networks has drawn increasing attention from multidisciplinary researchers, and has played an important role in network study. Many practical applications require search algorithms such as searching for the shortest relationship link in social networks, seeking web sites on the Internet, and finding specified files in data sets. The key issue for these tasks is how to achieve a fast search. However, traditional random-walk-based methods cannot solve this problem effectively. In order to fast travel, a novel search algorithm which employs a highest degree likelihood approach with k hunters looking for the target simultaneously is presented for different types of complex networks. A state transition matrix is applied to explain this proposed method. We compare the proposed algorithm with the methods of forerunner in the simulation, and the results show that our algorithm performs more effectively. Finally, some applications and future challenges are discussed. [ABSTRACT FROM AUTHOR]