The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Academic institutions are moving toward automated management of the educational process. One aspect of this process is the exam scheduling. The large number of students, classes, professors, and venues renders the manual scheduling process tedious and useless. In this paper, we describe the efforts of the Arab East College for High Education in Saudi Arabia in scheduling exams in the least number...
In this paper we consider efficient and low complexity scheduling algorithms for multiuser multiple-input multiple-output (MIMO) systems. The optimal user scheduling involves an exhaustive search, which becomes very complex for realistic numbers of users and transmit antennas. Among various suboptimal but low complexity algorithms, greedy algorithms with heuristic scheduling metrics have been shown...
In this paper, we consider efficient and low complexity scheduling algorithms for multiuser multiple-input multiple-output (MIMO) systems. Due to the dimensionality constraint imposed by linear precoding techniques like block diagonalization (BD), user scheduling is required. Optimal user scheduling involves an exhaustive search, which becomes very complex for realistic numbers of users and transmit...
In this paper we propose an opportunistic scheduling algorithm in wireless networks that reduces the feedback load with the aid of relaying, called relay aided opportunistic scheduling (RAOS). We consider a greedy algorithm in the sense that the network scheduler is always looking for the user with channel quality satisfying the highest transmission rate possible in the system. The algorithm is based...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.