We propose an improved restart strategy for randomized backtrack search, and evaluate its performance by comparing to other heuristic and stochastic search techniques for solving r...
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
— We present a new representation for individuals in problems that have cyclic permutations as solutions. To demonstrate its usefulness, we analyze a simple randomized local sear...
Abstract. The coalition structure generation problem represents an active research area in multi-agent systems. A coalition structure is defined as a partition of the agents involv...
Nicola Di Mauro, Teresa Maria Altomare Basile, Ste...
Attribute reduction of an information system is a key problem in rough set theory and its applications. Using computational intelligence (CI) tools to solve such problems has rece...