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.
In multiuser multiple input multiple output (MIMO) systems, it is optimal to serve multiple users at the same time in order to achieve high data rates. However, the use of a transmit beamforming technique requires a well designed user selection scheme to obtain good performances. The optimal scheduling solution can only be obtained through a highly computationally complex exhaustive search. In addition,...
In a recommender-based digital video recorder, TV programs are considered for automatic recording on a hard disk. The choice of which programs to record depends on (i) the scores assigned to the programs by the recommender, (ii) the times and channels at which the programs are broadcast, and (iii) the number of tuners available for recording. For a given set S of n programs that are broadcast in a...
Network coded multiuser uplink MIMO channels have been discussed in this paper. A three slots transmission is considered here and spatial division multiple access (SDMA) has been employed to serve multiuser simultaneously. Minimum mean-square-error successive interference cancellation (MMSE-SIC) is applied in the first two slots and singular value decomposition (SVD) is applied for the third slots...
Ant colony optimization (ACO) is a popular-based, artificial agent, general-search technique for the solution of difficult combinatorial problems. This paper presents a solution to the resource-constraint project scheduling problem based on ACO algorithm. The method considers the quantified duration and resource as the heuristic information to calculate the accurate state transition probability and...
We consider two natural models of local improvement. We show that the multiprocessor scheduling problem, i.e., the problem of scheduling weighted jobs on identical machines with the objective to minimize the makespan, is PLS-complete for a sufficiently large neighborhood. In the first model, in an improvement step, either the makespan decreases or the makespan remains unchanged and the number of makespan...
The optimal scheduling of Earth observation satellite is NP-complete. Most of the existing scheduling algorithms regard requests as the observations of point objects and adopt preprocessing methods, such as simple clustering, so as to decrease the problem size. There are also some algorithms in which requests are regarded as the observations of rectangular regions. However, actual requests are often...
This article presents a modified scheme named local search ant colony optimization algorithm on the basis of alternative ant colony optimization algorithm for solving flow shop scheduling problems. The flow shop problem (FSP) is confirmed to be an NP-hard sequencing scheduling problem, which has been studied by many researchers and applied to plenty of applications. Restated, the flow shop problem...
This paper introduces a new approach for decentralized distributed scheduling in a parallel machine shop environment based on the ant colonies optimization (ACO) algorithm. Distributed scheduling in parallel machine shop environment is a NP hard problem which is important to be studied from both theoretical and practical, point of view. The algorithm developed in this work extends the use of the traveling...
We consider the (generalized) packet switch scheduling problem, where the switch service configuration has to be dynamically chosen based on observed queue backlogs, so as to maximize the throughput. A class of recently developed 'projective' scheduling algorithms, which substantially generalize the well-known maximum weight matching (MWM) algorithms for crossbar switches, are explored from the perspective...
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.