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 flexible manufacturing systems (FMS), each job is formed of a set of operations that should be executed consecutive. Determining the sequence of operations and assigning proper machine to each operation are two important problems in scheduling FMS's. This is an NP-hard problem. Recently using heuristic methods, numerous algorithms are presented for solving this problem. In this paper for scheduling...
The important problem of distributed database systems(DDBs) is "data allocation". There are many methods for this problem and there are two measures for compare these models: Minimal cost and performance. In this paper we use a new method for using genetic algorithm. At first we generate clusters based on the communication cost between the sites,then perform genetic algorithm on these clusters...
In this paper, we propose an energy-aware QoS routing protocol for wireless sensor networks. The protocol finds energy-efficient paths for delay-constrained data in realtime traffic. The described QoS routing problem is very similar to typical path constrained path optimization (PCPO) problems, which are proved to be NP-complete. Hence we present a heuristic solution for the aforesaid problem. We...
The bandwidth-delay-constrained least-cost multicast routing is a challenging problem in high-speed multimedia networks. Computing such a constrained Steiner tree is an NP-complete problem. In this paper, we propose several novel solutions to this problem based on genetic algorithms (GA). The proposed solutions consist of six different schemes for genotype representation, and also several new heuristic...
Computing the bandwidth-delay-constrained least-cost multicast routing tree is an NP-complete problem. In this paper, we propose a novel QoS-based multicast routing algorithm based on the genetic algorithms (GA). In the proposed algorithm, the connectivity matrix of edges is used for genotype representation. Some novel heuristics are also proposed for mutation, crossover, and creation of random individuals...
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.