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.
The job shop scheduling problem (JSSP) is a well known NP-hard problem, and many algorithms have been presented to solve it, but the results are still unsatisfactory. In this paper, a hybrid discrete particle swarm optimization algorithm based on a two layer population structure is proposed to solve the JSSP, meanwhile add an improved simulated annealing algorithm to increase the ability of finding...
The traveling salesman problem (TSP) is a classical combinatorial optimization problem of operations research's area, which is simple to state. However, this problem is known to be NP-hard, and cannot be solved exactly in polynomial time. Therefore, it would seem to be an ideal candidate for nonstandard algorithmic approaches, such as natural computation. Natural computation is the computational version...
SOC integrates an intact system on one single chip, so that the size of chip is dwindled. However, the difficulty and complexity of system circuit testing is increased. Kinds of constraint conditions should be considered in testing cores, in order to meet the high-performance requirements of circuit system test, including the realization of parallel module test with test power and priority constrains...
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.