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.
Spectral unmixing (SU) is an emerging problem in the remote sensing image processing. Since both the endmember signatures and their abundances have nonnegative values, it is a natural choice to employ the attractive nonnegative matrix factorization (NMF) methods to solve this problem. Motivated by that the abundances are sparse, the NMF with local smoothness constraint (NMF-LSC) is proposed in this...
Nurse Rostering Problem (NRP) is one of NP - hard combinatorial optimization problems about the distribution of medical resources. In the past, there have been several proposed methods like heuristic algorithms and algorithms based on establishing rigorous mathematical models. Especially, the hybrid algorithm combined integer programming and evolutionary algorithm (IP+EA) have been proved to be effective...
Ant colony optimization (ACO) is one of the most famous bio-inspired algorithms. Its theoretical research contains convergence proof and runtime analysis. The convergence of ACO has been proved since several years ago, but there are less results of runtime analysis of ACO algorithm except for some special and simple cases. The present paper proposes a theoretical framework of a class of ACO algorithms...
Traveling salesman problem (TSP) is one of the most famous NP-hard problems, which has wide application background. Ant colony optimization (ACO) is a nature-inspired algorithm and taken as one of the high performance computing methods for TSP. Classical ACO algorithm like ant colony system (ACS) cannot solve TSP very well. The present paper proposes an ACO algorithm with multi-direction searching...
Ant colony optimization (ACO) has been proved to be one of the best performing algorithms for NP-hard problems as traveling salesman problems (TSP). However, it is necessary to set the parameters of ACO algorithm in manual way, in practice. This paper proposes a novel ACO algorithm with several automatic settings including adaptive weight parameter and adaptive volatility rate of pheromone trail....
The optical transpose interconnection system (OTIS), proposed by Marsden et al., is a hybrid optical and electronic interconnection system for large parallel computers. In this network model, Wang and Sahni in proposed the two size of NtimesN or kNtimeskN matrices multiplication algorithm, however, the algorithm of matrix multiplication about general matrix was not introduced , and the matrix multiplication...
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.