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.
A multistage graph is center problem of computer science, many coordination and consistency problems can be convert into multistage graph problem. We obtained the fitness function by coding the vertex of multistage graph, and designed the genetic algorithm for solving multistage graph problem. Experiment results show that this algorithm is very effective and feasible.
The Harmony Search (HS) method is an emerging meta-heuristic optimization algorithm. However, it is generally not so efficient in dealing with multi-modal optimization problems, in which instead of only a single optimum, multiple optima need to be found. In our paper, a novel HS method based on the niching technique (deterministic crowding), n-HS, is proposed and studied to overcome this shortcoming...
For an application in public-resource computing environments, providing reliable scheduling based on resource reliability evaluation is becoming increasingly important. Most existing reputation models used for reliability evaluation ignore the time influence. And very few works use a robust genetic algorithm to optimize both time and reliability for a workflow application. Hence, in this paper, we...
To optimize makespan and reliability for workflow applications, most existing works use list heuristics rather than genetic algorithms (GAs) which can usually give better solutions. In addition, most existing GAs evolve a scheduling solution randomly, which may give invalid solutions or lead to slow convergence of the algorithm. In this paper, we define three heuristics for GAs to decide the priorities...
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.