Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...
We propose the SocialTrust framework for tamper-resilient trust establishment in online social networks. Two of the salient features of SocialTrust are its dynamic revision of tru...
We consider the job shop scheduling problem unit−Jm, where each job is processed once on each of m given machines. Every job consists of a permutation of tasks for all machines....
Abstract—Proportional Fair (PF) is a frequently used channelaware scheduling algorithm in 3G wireless networks. However, recent work by us and others has shown that, in practice,...
Subject to limited computational resource, feedback scheduling aims to improve, or to optimize, the global control performance of real-time control systems. For the system that co...