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 traditional Generalized Assignment Problem (GAP) problem consists of assigning n different tasks to m different agents, while minimizing a cost function. Additionally, it is necessary to ensure that each task is assigned to a single agent (indivisible task) and that the maximum resource capacity of the agents is honored. In this paper, the problem is extended to a bi-objective formulation, in...
Pairwise test set generation is the process of producing a subset of all possible test case inputs to a system in situations where exhaustive testing is not possible or is prohibitively expensive. For a given system under test with a set of input parameters where each parameter can take on one of a discrete set of values, a pairwise test set consists of a collection of vectors which capture all possible...
N-Queen problem is a typical combination optimization problem and it belongs among NP-hard problems. Its common solution is recursive algorithm. When the problem is complex, it will cost much more time for solution. Compared with the recursive algorithm, genetic algorithm can be component for the complex situation. In view of this, a hybrid genetic algorithm was presented in this paper to solve the...
K-anonymization implemented by microaggregation is a special clustering problem with minimum cardinality constraint, which has been proved to be an NP-hard combinatorial optimization problem. The existing heuristic microaggregation algorithms search the solutions in a limited solution space, so can only get local optimal solutions. The paper proposes an ICSMA (immune clonal selection microaggregation...
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.