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 this article, a distributed clustering technique, that is suitable for dealing with large data sets, is presented. This algorithm is actually a modified version of the very common k-means algorithm with suitable changes for making it executable in a distributed environment. For large input size, the running time complexity of k-means algorithm is very high and is measured as O(TKN), where K is...
In practical application, aiming at large-scale complex industry systems, in order to implement robust control to them, one very large control horizon is usually needed by using of the traditional model predictive control (MPC) methods, therefore, the high computational complexity and large computational burthen are also met. For the above cases, the paper firstly uses the multiscale decomposition...
In practical application, aiming at large-scale complex industry systems, in order to implement robust control to them, one very large control horizon is usually needed by using of the traditional model predictive control (MPC) methods, therefore, the high computational complexity and large computational burthen are also met. For the above cases, the paper firstly uses the multiscale decomposition...
An effective scheduling algorithm is key to achieving high performance. This paper presents an algorithm based on task duplication to schedule an out-tree task graph which represents a number of divide-and-conquer algorithms. The scheduling algorithm has the shortest possible scheduling length and economizes the processors with O(|e|/spl middot/|/spl nu/|/sup 2/) complexity. Moreover, it also outperforms...
The arithmetic Fourier transform (AFT) is a number-theoretic approach to Fourier analysis which has been shown to perform competitively with the classical FFT. A 2-D AFT algorithm using same method is developed on the basis of a 1-D AFT algorithm. The analysis of the complexity and the architecture of the 2-D AFT algorithm shows that 2-D AFT can also perform competitively with the classical 2-D FFT...
We analyse an SRT radix-2 division algorithm where the determination of the quotient digits is performed in parallel with the update of the residual. We show that this digit prediction requires a simple selection function. Our algorithm does not need any prescaling as, on the other hand, it is required from other prediction-based techniques in order to reduce the complexity of the selection function...
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.